Mt s im lu khi dng lnh solve

1. Gii phng trnh lng gic

Th1:
> restart;
> solve(sin(x)+cos(x)=1,{x});
Th2:
> restart;
> _EnvAllSolutions:=true;
> solve(sin(x)+cos(x)=1,{x});
2. Tm nghim a thc (bc <5)
Th1:
> restart;
> solve( x^4 2*x^3 + 2=0, x );
> allvalues({%});
Th2:
> restart;
> _EnvExplicit:=true;
> solve( x^4 2*x^3 + 2=0, {x} );
> _EnvExplicit:=false;
> solve( x^4 2*x^3 + 2=0, x);
> allvalues
;
> _EnvExplicit:=numeric;
> solve( x^4 2*x^3 + 2=0, x);
C th thy rng trng hp 2, khi b sung _EnvAllSolutions:=true hoc _EnvExplicit:=true th ta thu c nghim y v r rng hn.
TP TIN C LU : *** TNH TON C BN
Tnh gi tr ca dy s theo h thc truy hi
THNG SU 5, 2010 BI MAPLEVN2008 LI PHN HI
Bi ny gii thiu mt vi phng php tnh gi tr ca dy s theo h thc truy hi. Chng ta ly v d v dy s Fibonaxi lm minh ha cho
cc phng php .
1. S dng lnh define
> restart;
> define(f,f(0)=1,f(1)=1,f(n::posint)=f(n-1)+f(n-2));
> f(3);
> f(20);
2. S dng hm tng khc
> restart;
> f:=n->piecewise(n=0 or n=1,1,f(n-1)+f(n-2));
> f(4);
> f(9);
Lu : Hai phng php trn c nhc im l khng th tnh gi tr vi nhng s hng ng vi n ln. Hai phng php sau y s gip ta
gii quyt nhanh chng vn .
3. S dng lnh rsolve vi tham s makeproc
> restart;
> f:=rsolve({f(n)=f(n-1)+f(n-2),f(0)=1,f(1)=1},f,makeproc);
> f(9);
> f(100);
4. S dng th tc quy vi option remember.
> restart;
> f:=proc(n)
option remember;
if n=0 or n=1 then return 1;
else return f(n-1)+f(n-2);
end if;
end proc:
> f(10);
> f(100);
Lu : Nu khng s dng option remember trong th tc ny th ta cng s gp kh khn khi tnh cc s hng ln.
TP TIN C LU : *** LP TRNH C S, *** TNH TON C BN TAGGED WITH C BN, LP TRNH
Lu khi tnh gii hn cha cn thc
THNG NM 28, 2010 BI MAPLEVN2008 LI PHN HI
Xt v d:
Nhiu bn s g lnh nh sau:
>limit((1+(x-1)^(1/3))/x,x=0);
V kt qu t c l Maple bo khng xc nh. Tuy nhin d dng thc hin bng tay ta tnh c gii hn bng 1/3. Vy nguyn nhn
l do u ?
tr li cho cu hi ny, ta th i tm gii hn ca t s xem sao.
>limit(1+(x-1)^(1/3),x=0);

Kt qu thu c l:
l mt s phc, ch khng phi kt qu l 0 nh ta bit.
iu ny c gii thch l hm l tha (x^a) trong Maple c nh ngha nh hm phc, x c th nhn gi tr m hay dng. Do cch
vit l (x-1)^(1/3) khng tng ng trong Maple. trnh tnh trng ny, Maple nh ngha ring hm cn thc vi c php surd(x,n).
V d:
>surd(x+2,n);
>surd(x^3+2*y,6);
Do tnh gii hn trn, cc bn cn vit lnh
>limit((1+surd(x-1,3))/x,x=0);
TP TIN C LU : *** TNH TON C BN TAGGED WITH C BN
Tnh tng v tch cc nghim
THNG T 28, 2010 BI MAPLEVN2008 LI PHN HI
S dng chc nng ca hm sum v product ta c th tnh tng v tch cc nghim ca mt a thc mt cch nhan chng.
C php:
sum(k,k=RootOf(da_thuc,bien));
product(k,k=RootOf(da_thuc,bien));
V d:
> P:=4*x^4-7*x^3+8*x^2-23*x+31;
> Sum(x[i],i=1..4)=sum(k,k=RootOf(P,x));
> Product(x[i],i=1..4)=product(k,k=RootOf(P,x));
> Sum(x[i]^2,i=1..4)=sum(k^2,k=RootOf(P,x));
> Sum(x[i]^3,i=1..4)=sum(k^2,k=RootOf(P,x));
> Sum(x[i]^4,i=1..4)=sum(k^2,k=RootOf(P,x));
TP TIN C LU : *** TNH TON C BN
Ton t Logic (t2)
THNG MI HAI 20, 2009 BI MAPLEVN2008 LI PHN HI
1. Hin th bng chn tr
TruthTable(expr, L, opt)
trong :
- expr: biu thc logic
- L: danh sch cc bin
- opt: c dng form=boolean hoc MOD2 ( theo module 2)
V d:
> with(Logic);
> BT:=a &and (b &or c) &implies c;
L:=[a,b,c];
> res:=TruthTable(BT,L);
- C th minh ha trn Maplet
> ind:=indices(res);
ent:=entries(res);
>Maplets[Examples][ShowTable]([[op(L),"BT"],seq([op(ind[i]),op(ent[i])],i=1..2^nops(L))]);
2. n gin biu thc
BooleanSimplify(b)
V d:
> with(Logic):
BooleanSimplify(a &and b &or (a &and b));
> BooleanSimplify((a &and b) &or (a &or (&not b)));
> BooleanSimplify((a &and b) &iff (a &or b));
> BooleanSimplify(&or(a &and b, (&not a) &or c, b &and c));
3. Kim tra s tng ng ca hai biu thc logic
Equivalent(bt1,bt2, p);
trong : tham s p c th c hoc khng. Tham bin p s lu gi tr true nu bt1 v bt2 tng ng logic, v false trong trng hp
ngc li.
V d:
> with(Logic):
Equivalent(a &and (a &or b), a);
> Equivalent(a &iff (a &or b), b &implies a);
> Equivalent(a &implies b, b &implies a, p);
> p;
> Equivalent(&not(a &and b), (&not a) &or (&not b), p);
> p;
Implies(a &and b, a &implies b);
TP TIN C LU : *** HC QUA V D MU, *** LP TRNH C S, *** TNH TON C BN TAGGED WITH BIU THC, C BN
Chun ca vecto
THNG SU 6, 2009 BI MAPLEVN2008 LI PHN HI
tnh chun ca vecto ta s dng lnh VectorNorm trong gi LinearAlgebra. Cu trc lnh:
VectorNorm(V, p, c);

Trong :
-V: vecto
-p: nhn cc gi tr:
+ Euclidean, Frobenius
+ infinity : tc l chun ca vecto bng max( seq( abs(V[i]), i = 1 .. Dimension(V) ) )
+ nhn 1 s dng p: tc l chun ca vecto bng add(abs(V[i])^p, i = 1 .. Dimension(V))
-c : c dng conjugate=true (nu khi tnh chun s dng Hermitian transpose) v conjugate=false (trong trng hp ngc li). Mc nh
conjugate=true.
V d:
> with(LinearAlgebra);
> VectorNorm( <2,I>,Euclidean);
> VectorNorm( <2,-4*I>,infinity);
> VectorNorm( <2,4*I,3>,5);
> VectorNorm( <2,0>, 0.5);
> v := <a,b,c>;
> VectorNorm(v,2);
> VectorNorm(v,2,conjugate=false);
> VectorNorm(v,2,conjugate=true);
Ngoi ra Maple cn cung cp cho chng ta 1 giao din dng sn gip tnh chun ca vecto.
> restart;
> with(Maplets[Examples][LinearAlgebra]);
> VectorNorm(<2,3,4>);
TP TIN C LU : *** TNH TON C BN TAGGED WITH C BN, MAPLET, V D, VECTOR
Bin i Fourier v Laplace
THNG NM 31, 2009 BI MAPLEVN2008 LI PHN HI
y l cc php bin i hay c s dng trong tnh ton gii tch, c bit trong tnh cc tnh phn, gii phng trnh vi phn v phng
trnh o hm ring,
1. Bin i Fourier:
fourier(expr,x,w);
Trong :
- expr: hm hay ng thc (nh pt vi phn) theo bin x
- w: biu thc lien quan n bin mi
V d:
> with(inttrans);
> fourier(f(x),x,t);
convert(%,int);
> fourier(x*sin(x),x,t);
> fourier(1/(1+x^2),x,t);
> fourier(1/(a+x^2),x,t) assuming a>0;
> fourier(1/(4 I*t)^(1/3),t,w+a);
> fourier(diff(y(t), t$2)-y(t)=sin(a*t), t, s) assuming a>0;
2. Bin i Laplace:
laplace(expr,x,w);
V d:
> with(inttrans);
> laplace(f(x),x,t);
convert(%,int);
> laplace(x*sin(x),x,t);
> laplace(1/(1+x^2),x,t);
> laplace(1/(a+x^2),x,t) assuming a>0;
> laplace(t^2+sin(t)=y(t), t, s);
> laplace(t^(3/2)-exp(t)+sinh(a*t), t, s);
> laplace(diff(y(t), t$2)-y(t)=sin(a*t), t, s-2);
TP TIN C LU : *** TNH TON C BN TAGGED WITH BIU THC, C BN, TCH PHN
Gii h bt phng trnh tuyn tnh
THNG NM 26, 2009 BI MAPLEVN2008 LI PHN HI
gii quyt cc h phng trnh tuyn tnh chng ta s dng gi lnh SolveTools:-Inequality, trong chng ta quan tm n 2 lnh sau:
1. LinearMultivariateSystem(sys, varlist);
Lnh ny cho php gii h (sys) tuyn tnh vi nhiu n (varlist) ), trong c cho php bin lun theo cc tham s c mt trong h sys.
2. LinearUnivariateSystem(sys, var);
Chc nng tng t nhng p dng cho h 1 n.
Cc v d minh ha:
> with(SolveTools:-Inequality):
> LinearMultivariateSystem({y<x-1,y>1-x},[x,y]);
> LinearMultivariateSystem({y<x-1,y>1-x},[y,x]);
> LinearMultivariateSystem({y>x-1,y<1-x,y>-3*x-1},[x,y]);
> LinearMultivariateSystem({y>x-1,y<1-x,y>-3*x-1},[y,x]);
> LinearMultivariateSystem({x < 3, y < 3, -x < 3, -y < 3,
y-x < 4, y+x < 4, -x-y < 4, x-y < 4},[x,y]);

> LinearMultivariateSystem({a*x+y<1,x-y>2},[x,y]);
> LinearMultivariateSystem({a*x+y<a,x-y>2*a},[x,y]);
> LinearMultivariateSystem({x+y+z<1,x-y+z<2},[y,x,z]);
> LinearUnivariateSystem({x+1<0,2*x-1>0},x);
> LinearUnivariateSystem({x+a<0,2*x-1>0},x);
> LinearUnivariateSystem({2*x+a<=0,2*x-b>=0},x);
> LinearUnivariateSystem({a*x+2<=0,2*x-b>=0},x);
> LinearUnivariateSystem({a*x+b<0,c*x+d>=0},x);
TP TIN C LU : *** TNH TON C BN TAGGED WITH C BN, V D
Trc cn thc mu
THNG NM 14, 2009 BI MAPLEVN2008 LI PHN HI
Bi ton Trc cn thc mu l bi ton rt hay gp khi hc ton cp trung hc c s. Cc bn nh cng nh cc thy c c th s
dng Maple kim tra p s mt cch nhanh chng.
Cu trc lnh: rationalize(bieuthuc);
Cc v d:
> 2/(2-sqrt(2));
> rationalize
;
> (1+2^(1/3))/(1-2^(1/3));
> rationalize
;
> [ x/(x+sqrt(3)), x/(x+sqrt(1+sqrt(3))),(x+y)/(x*y+sqrt(3)+sqrt(7))];
> rationalize
;
> [(x+y)/(x+sqrt(y)), x*y/(x+sqrt(x+sqrt(3)))];
> rationalize
;
> 1/(1+root(sin(1/(1-sqrt(eta))),3));
> rationalize( % );
> 1/(1+(1/(1-sqrt(a)))^(1/3));
> rationalize( % );
TP TIN C LU : *** TNH TON C BN TAGGED WITH BIU THC, C BN
Cc lnh hnh thc hay gp
THNG T 24, 2009 BI MAPLEVN2008 LI PHN HI
1. Tnh tch: Product(f(k),k=n..m);
> Product(f(i),i=1..n);
> Product(x^i,i=1..n);
> value

> simplify
;
> Product(1+1/i^2,i=1..infinity)=product(1+1/i^2,i=1..infinity);
2. Tnh tng: Sum(f(k),k=n..m);
> Sum(f(i)/g(i+2),i=1..n);
> Sum(x^i,i=1..n);
> value

> simplify
;
> Sum(1/i^4,i=1..infinity)=sum(1/i^4,i=1..infinity);
3. Tnh o hm: Diff(f(x1,..,xn),x1,,xn);
> Diff(f(x+y),x);
> Diff(f(x+y),x,y$n);
> Diff(sin(x)*exp(x),x$2);
> value
;
4. Tnh tch phn: Int(f(x),x); Int(f(x),x=a..b);
> Int(f(x),x=a..b);
> Int(f(x),x);
> Int(exp(-t^2),t=-infinity..infinity)=int(exp(-t^2),t=-infinity..infinity);
5. Tnh gii hn:
Limit(f(x),x=a); Limit(f(x),x=a,right); Limit(f(x),x=a,left);
> Limit(f(x),x=0);
> Limit(sin(x)/x,x=0)=limit(sin(x)/x,x=0);
> Limit(sin(x)/abs(x),x=0)=limit(sin(x)/abs(x),x=0);
6. Tnh gi tr ca biu thc:
Eval(f(x),x=a); Eval(f(x1,,xn),{x1=a1,,xn=an});
y l lnh rt hay c s dng th hin cc iu kin u v iu kin bin trong cc bi ton v gii phng trnh vi phn.
> Eval(U(x,t),t=0);
> Eval(U(x,t),t=0)=f(x);
> Eval(U(x,y,z),{x=a,y=b})=Phi(z);
> Eval(Diff(sin(x)*exp(x),x$3),x=Pi)=eval(diff(sin(x )*exp(x),x$3),x=Pi);

TP TIN C LU : *** TNH TON C BN TAGGED WITH C BN, LP TRNH

Xem Maple nh ngha cc hm c bit.
THNG T 6, 2009 BI MAPLEVN2008 LI PHN HI
Maple cung cp rt nhiu cc hm s c bit c nhiu ng dng trong cc bi ton vi phn, tch phn, Bn cnh Maple cn cho php
ngi dng xem nh ngha cng nh mt vi ch v cc tnh cht ca cc hm ny thng qua hm FunctionAdvisor. Chng ta cng quan
st mt vi v d i vi cc hm sin, cos, GAMMA, Beta, BesselI.
- xem tt c thng tin m Maple cung cp v hm sin
> FunctionAdvisor(sin);
- xem nh ngha
> FunctionAdvisor(sin,definition);
- xem khai trin chui
> FunctionAdvisor(sin,series);
- cc gi tr c bit
> FunctionAdvisor(sin,special_values);
- tng t cho cc hm s khc
> FunctionAdvisor(cos);
> FunctionAdvisor(GAMMA);
> FunctionAdvisor(BesselI);
Ch : Cc tham s nh definition,series, chnh l cc t kha xut hin trong lnh xem tng th.
TP TIN C LU : *** TNH TON C BN
Giao din cho lnh v th
THNG BA 23, 2009 BI MAPLEVN2008 LI PHN HI
Maple to sn mt giao din v ha rt p, h tr cho ngi s dng khi v th . V d:
> plot(sin(x),x=-Pi..Pi);
th th s v ngay trn trang lm vic, iu ny c gii thch l ch mc nh tham s plotdevice nhn gi tr inline.
s dng giao din khi v, bn thay thi tham s ca plotdevice. Cc v d:
> interface(plotdevice=window);
> plot(x*sin(x),x=-Pi..Pi);
> interface(plotdevice=window);
> plots[animate]( plot, [A*(x^2-1),x=-4..4], A=-2..2 );
> interface(plotdevice=window);
> plots[animate3d]((1.3)^x * sin(u*y),x=-1..2*Pi,y=0..Pi,u=1..8, coords=spherical);
Ch : Lnh interface(plotdevice=window); ch c tc dng mt ln v sau plotdevice nhn li gi tr mc nh inline, nn mun s dng
giao din khi v th, bn phi gi li.
TP TIN C LU : *** TNH TON C BN TAGGED WITH GIAO DIN, TH
th hm gin on loi 1.
THNG BA 13, 2009 BI MAPLEVN2008 LI PHN HI
Khi v th trn Maple, nu hm s c im gin on loi mt (tc tn ti gii hn hu hn 2 pha) th Maple t ng ni th thnh
mt ng cong lin tc. Chng hn khi v th hm phn phi mu hay th hm phn nguyn, nhiu bn a n kt lun sai lm
l: l cc hm lin tc trn ton trc s ( thc t ch l cc hm lin tc tng khc). Quan st th:
- th hm phn nguyn
> plot(trunc(x),x=0..5);
- th hm phn phi mu
> data:=[2,3,4,2,3,4,5,3,2,4]:
> ind:=x->piecewise(x>0,1,0):
> Fn:=unapply(simplify(add(ind(x-i),i in data)/nops(data)),x);
>plot(Fn(x),x=1..6);
V th v th c chnh xc, khi bit hm s c im gin on, bn nn b sung thm tham s discont=true vo lnh v th.
> plot(trunc(x),x=0..5,discont=true);
hay
> data:=[2,3,4,2,3,4,5,3,2,4]:
> ind:=x->piecewise(x>0,1,0):
> Fn:=unapply(simplify(add(ind(x-i),i in data)/nops(data)),x);
>plot(Fn(x),x=1..6,discont=true);
Mt v d khc:
> plot(abs(sin(x-1))/(x-1),x=-Pi..Pi);
> plot(abs(sin(x-1))/(x-1),x=-Pi..Pi,discont=true);
TP TIN C LU : *** TNH TON C BN TAGGED WITH TH
Php ton trn Vector
THNG BA 11, 2009 BI MAPLEVN2008 LI PHN HI
Chng ta se s dng cc lnh trong gi LinearAlgebra. Quan st cc v d sau:
> with(LinearAlgebra);
> v1 := <1,2,0>:
v2 := <0,1,0>:
v3 := <5,2,0>:
v4 := <4,1,1>:
v5 := <1,-1,1>:

v6 := <4,2,0>:
v7 := <3,0,-1>:
> x:=<a,b,c,d,e,f,g>;
- ly vector con
> x[1..3];
> x[3..7];
> x[[1,4,5,4]];
> SubVector(x,[2,3,4,1]);
> SubVector(x,2..5);
- tch v hng
> v1.v2;
> Transpose(v1).v2;
> DotProduct(v1,v2);
> DotProduct(<a,b,c>,<x,y,z>);
- tch c hng (ch s dng cho trng hp 3 chiu)
> CrossProduct(v1,v2);
> CrossProduct(<a,b,c>,<x,y,z>);
- ly c s ca mt h vector
> Basis([v1,v2,v3]);
> Basis([v1,v2,v3,v4]);
- ly c s ca khng gian tng to ra bi 2 hay nhiu h vector
> SumBasis([ [v1,v2] , [v6,v7] ]);
> SumBasis([ [v1,v2] , [v5,v6,v7] ]);
- ly c s ca khng gian giao to ra bi 2 hay nhiu h vector
> IntersectionBasis([ [v1,v2,v3], [v4,v5,v6] ]);
> IntersectionBasis([ [v1,v2,v3,v4], [v5,v6,v7] ]);
> coso:={<1,2,0,1>,<2,0,3,1>,<0,1,-2,0>};
- trc giao ha h vector c lp tuyn tnh bng phng php GramSchmidt.
> GramSchmidt(coso);
- trc chun ha
> GramSchmidt(coso,normalized);
TP TIN C LU : *** TNH TON C BN TAGGED WITH VECTOR
th hm s n
THNG BA 9, 2009 BI MAPLEVN2008 LI PHN HI
Nhiu bi ton lin quan n vn v th ca hm s c cho di dng hm n nh f(x,y)=0 hay f(x,y,z)=0. Maple cung cp cho
chng ta cc lnh tng ng v cc loi th ny. Cc lnh ny nm trong gi plots.
- th 2d:
implicitplot(f(x,y),x=a..b,y=c..d,opts);
- th 3d:
implicitplot3d(f(x,y,z),x=a..b,y=c..d,z=e..f,opts) ;
Cc v d p dng:
- u tin ta gi gi lnh
> with(plots);
- v hnh trn
> implicitplot((x-1)^2+y^2=1, x=0..2, y=-1..1);
> implicitplot((x-1)^2+y^2=1, x=0..2, y=-1..1,color=blue,thickness=3);
> implicitplot((x-1)^2+y^2=1, x=0..2, y=-1..1,filled=true);
> implicitplot((x-1)^2+y^2=1, x=0..2, y=-1..1,filled=true,coloring=[cyan,red]);
- v hnh cu
> implicitplot3d((x-1)^2+y^2+(z-2)^2=1, x=0..2, y=-1..1,z=1..3);
> implicitplot3d((x-1)^2+y^2+(z-2)^2=1, x=0..2, y=-1..1,z=1..3,numpoints=5000);
- v ellip
> implicitplot(x^2/9+y^2/4=1,x=-3..3,y=-2..2,scaling=constrained);
- minh ha ellip v parabol
> implicitplot([x^2/9+y^2/4=1,y^2=x],x=-3..3,y=-2..2,scaling= constrained,color=[blue,red]);
- minh ha hnh nn v mt phng
> implicitplot3d([z=x^2+y^2,x+y+2*z=4],x=-3..3,y=-3..3,z=0..5, color=[cyan,wheat]);
TP TIN C LU : *** TNH TON C BN TAGGED WITH TH
V th tham s
THNG BA 6, 2009 BI MAPLEVN2008 9 PHN HI
1. th 2D:
plot([x(t),y(t),x=a..b],opts);
V d:
> plot([sin(t), cos(t), t=0..Pi]);
> plot([(t^2-1)/(t^2+1), 2*t/(t^2+1), t=-infinity..infinity]);
- c th v nhiu th mt ln, chng hn
> plot([[2*cos(s), sin(s), s=0..2*Pi], [cos(t), sin(t), t=0..2*Pi]],
color=[blue,yellow]);
2. th 3D:

plot3d([x(u,v),y(u,v),z(u,v)],u=a..b,v=c..d,opts);
V d:
> plot3d([sin(x-y), 2*y,x], x=-Pi..Pi, y=-Pi..Pi);
> plot3d([cos(x)-2*cos(0.4*y), sin(x)-2*sin(0.4*y), y],x=0..2*Pi, y=0..10);
- i vi trng hp ny ta cng c th v nhiu th mt ln, chng hn
> c1:= [2*cos(x)*sin(y), 3*sin(x), 5*cos(x)*cos(y)]:
c2:= [y, x, y]:
> plot3d([c1,c2],x=-Pi..Pi, y=-5..5);
TP TIN C LU : *** TNH TON C BN TAGGED WITH TH
Cc tr ca hm s
THNG BA 3, 2009 BI MAPLEVN2008 LI PHN HI
1. Cc tr khng iu kin
minimize(expr);
maximize(expr);
minimize(expr,x1=a1..b1,x2=a2..b2,..);
maximize(expr,x1=a1..b1,x2=a2..b2,..);
V d:
> minimize(cos(x)+x*sin(x), x=1..3);
> minimize(cos(x)+x*sin(x), x=1..3,location);
> maximize(cos(x)+x*sin(x), x=1..3);
> maximize(cos(x)+x*sin(x), x=1..3,location);
> minimize(x^2-3*x+y^2+3*y+3);
> minimize(x^2-3*x+y^2+3*y+3, location);
> minimize(x^2-3*x+y^2+3*y+3, x=2..4, y=-4..-2, location);
> minimize(abs(exp(-x^2)-1/2), x=-4..4);
> minimize(x^4 x^2, x=-3..3, location=true);
> minimize(x^2 + cos(x), x=0..3);
2. Cc tr c iu kin
Chng ta s s dng lnh Minimize v Minimize trong gi Optimization.
Minimize(expr,{cc iu kin });
Minimize (expr,{cc iu kin });
V d:
> with(Optimization);
> Minimize(cos(x));
> Minimize(2*x+y, {4*x-y<=9, x+y>=4,x>=0,y>=0});
> Minimize(2*x+y, {4*x-y<=9, x+y>=4},assume=nonnegative);
> Minimize((x-1)^2 + (x-y)^2 , {x^2+(1+y^2)<=8,x>=2});
> Minimize((x-1)^2 + (y-1)^2 + (z-1)^2, {x*(1+y^2+z^2)>=8});
> Maximize(2*x^2+y+2*y^2, {y^2-x<=2, 2*x+y<=6});
3. Cc tr hm vi bin nhn gi tr nguyn
Trng hp ny ch xt cho hm tuyn tnh v cc iu kin b chn cng c dng tuyn tnh.
Minimize(expr,{cc iu kin },assume=integer);
Minimize (expr,{cc iu kin },assume=integer);
V d:
> Maximize(2*x+y, {4*x+y<=90, x+y>=4,x>=0,y>=0},assume=integer);
> Maximize(2*x+y+2*y, {y-x<=2, 2*x+y<=6},assume=integer);
TP TIN C LU : *** TNH TON C BN
Tnh gii hn
THNG BA 3, 2009 BI MAPLEVN2008 LI PHN HI
Gii hn l php ton hay gp trong gii tch. Bn c th tnh gii hn ca hm hay dy s bng Maple. V d:
1. Gii hn hm s:
> f:=(1-cos(x))/(x*sin(x));
> limit(f,x=0);
> ff:=(1-cos(x))/(x*abs(x));
- ly gii hm bn tri, bn phi
> limit(ff,x=0,right);
> limit(ff,x=0,left);
> limit(ff,x=0);
> limit((1+x/n)^n,n=infinity);
> limit((1+x^3/(n*x-2))^n,n=infinity);
- Maple c cung cp chi chng ta mt giao din dng sn minh ha hnh nh gii hn im ca mt hm s.
> Student[Precalculus][LimitPlot](x^2+ln(1+x^2),x=2);
> Student[Precalculus][LimitTutor](sin(x)/x,x=0);
2. Gii hn ca dy, chui
> Limit((n/(n-2)+n/(3*n^2-1))^(n^2/(n-1)),n=infinity);
%=limit((n/(n-2)+n/(3*n^2-1))^(n^2/(n-1)),n=infinity);
> Limit(Sum(1/i!,i=1..n),n=infinity);
%=sum(1/i!,i=1..infinity);
> Sum((i^2-1)^2/i!,i=1..infinity);

%=sum((i^2-1)^2/i!,i=1..infinity);
> Sum((-1)^i*1/i^2,i=1..infinity);
%=sum((-1)^i*1/i^2,i=1..infinity);
Ch : Sum,Limit ch minh ha cng thc dng hnh thc.
TP TIN C LU : *** TNH TON C BN
Tch phn s
THNG HAI 26, 2009 BI MAPLEVN2008 4 PHN HI
Ngoi kh nng tnh gii tch rt tt, Maple cng cung cp cho chng ta chc nng tnh tch phn bng phng php s. Cu trc c bn
evalf(Int(f(x1,x2,,xn),[x1=a1..b1,x2=a2..b2,...,xn=an..bn],options));
- trong options bao gm method, digits,epsilon (sai s)
Cc bn thng xuyn phi tnh tch phn s th c th xem thm trong help cc phng php qua lnh
>?evalf/Int
Mt vi v d:
> evalf(Int( exp(-x^3)/(x^2+1), x = 0..1 ));
> evalf(Int( 1/(x^2+1), x = 0..infinity ));
> evalf(Int( sin(x)*ln(x)*exp(-x^3), x = 0..infinity ));
> e1 := 1/GAMMA(x):
Int(e1, x = 0..2) = evalf(Int(e1, x=0..2, digits=20, method=_Dexp));
> e2 := exp(v-v^2/2)/(1+1/2*exp(v)):
Int(e2, v=0..infinity) = evalf[20]( Int(e2, v=0..infinity) );
> evalf(Int(x^3*ln(x^2+y^4+2)/exp(x-y),[x=0..1,y=1..2]));
> evalf(Int(x^3*ln(x^2+y^4+2)/exp(x-z)+ln(z+y^x), [x=0..1,y=1..2,z=0..2]));
TP TIN C LU : *** TNH TON C BN TAGGED WITH PHNG PHP TNH, TCH PHN
Php ton trn ma trn (t6)
THNG HAI 9, 2009 BI MAPLEVN2008 3 PHN HI
> with(LinearAlgebra);
- bnh phng ti thiu ca m hnh
> X := <<3,0,4>|<-2,3,4>>:
y := <1,2,4>:
beta := LeastSquares(X, y);
- gii h tuyn tnh A x=b
> A := <<1,1,1,4>|<1,1,-2,1>|<3,1,1,8>|<-1,1,-1,-1>>:
b:=<0,1,1,0>:
x:=LinearSolve(A,b);
> A := <<1,0,0>|<2,1,0>|<1,0,0>|<-1,-1,-3>>:
b := <2,-1,-9>:
LinearSolve(A, b);
- thay i bin t do
LinearSolve(A, b, free=s');
- gii h tuyn tnh A x=B trong A,B l 2 ma trn
> A := <<0,1,1,1,1>|<2,-2,0,-2,-3>|<0,0,1,1,3>|<-6,0,-3,-1,-3>|<2,2,2,2,4>>:
B := <<1,6,0,9,4>|<1,2,3,4,5>>:
LinearSolve(A,B);
- Ly tha ca ma trn, ch v s khc bit gia ton t ^ v MatrixPower.
> A:=<<3,0,4>|<-2,3,4>|<2,3,1>>:
A^3;
MatrixPower(A,3);
> A^(3/2);
MatrixPower(A,3/2);
> A^(-1/2);
MatrixPower(A,-1/2);
- tnh hay
> A := Matrix([[-13, -10], [21, 16]]);
> MatrixExponential(A);
> MatrixExponential(A, t);
> MatrixExponential(A, -t);
- hm ma trn
> A := Matrix([[-13, -10], [21, 16]]);
> MatrixFunction(A, v^2, v);# A^2
> MatrixFunction(A, sin(t), t); #sin(A)
> MatrixFunction(A, exp(t), t); #exp(A)
> MatrixExponential(A, t); # exp(At)
> MatrixFunction(A, exp(v*t), v); # exp(At)