You are on page 1of 14

ph lc

Danh mc cc lnh thng dng


Tn lnh
AFactor

Chc nng
Phn tch trit mt a thc (P) ra tha s
trn bao ng i s ca trng cc h s.
Vn ng ca th trong khng gian hai
animate
chiu
animate3d Vn ng ca th trong khng gian 3 chiu

array
basis
BesselI
BesselJ
BesselK
BesselY
Beta

Chi

animate(f(x,t),
x=a..b,t=c..d)
animate(f(x,y,
t),x=a..b,y=
c..d,t=p..q)
To mng hoc ma trn
array(indexfcn
,bounds,list)
Tm c s cho mt h vc t
basis(v1,v2,..
vn)
Hm Bessel loi 1 sa i (tho mn phng BesselI(v,x)
trnh x 2 y "+ xy ' ( x 2 + y 2 ) y = 0 )
Hm Bessel loi 1 (tho mn phng trnh
BesselJ(v,x)
x 2 y "+ xy '+ ( x 2 y 2 ) y = 0 )
Hm Bessel loi 2 sa i
BesselK(v,x)
Hm Bessel loi 2
BesselY(v,x)
Hm B-ta, tc l hm
Beta(x,y)
( x) + ( y )
( x, y ) =
( x + y )
Hm Tch phn Cosine Hyperbolic, tc l hm Chi(x)
x

Chi ( x) = + ln( x) +
0

Ci

Ci ( x) = + ln( x) +
0

coeffs

coeftayl

cosh(t ) 1
dt
t

Hm Tch phn Cosine, tc l hm


x

coeff

C php
AFactor(P)

Ci(x)

cos(t ) 1
dt
t

Chit xut h s ca n thc x n trong a


thc P
Chit xut cc h s ca a thc (nhiu bin)
theo a bin hoc theo n bin (x), v c th
gn tn cho dy cc n thc tng ng vi
cc h s chit xut (t)

coeff(p,x,n)
coeff(p,x^n)
coeffs(P),
coeffs(P,x),
coeffs(P,x,t)

Tnh cc h s thnh phn x k (x c th l coeftayl(expr


vect v k cng vy) trong khai trin Taylor ,x=a,k)
215

vect, v k cng vy) trong khai trin Taylor


ca biu thc expr ti im a
Xp cc s hng ca a thc vo cc nhm
collect
theo ly tha ca bin x
comparray So snh cc mng A v B
Xc nh (pht hin) a thc hp, tc l tm
compoly
cc cp a thc p,q (nu c) r = p (q (.))
conjugate Ly lin hp (phc) ca 1 biu thc
Ly content ca a thc theo bin x, tc l
content
c s chung ln nht ca cc h s theo bin
x
Chuyn biu thc (expr) v dng (form)
convert
cho
Hm lng gic Cosine
cos
Hm lng gic Hyperbolic Cosine
cosh
Tnh s lng cc php tnh trong mt biu
cost
thc
Hm lng gic Cotan
cot
Hm lng gic Hyperbolic Cotan
coth
crossprod Tnh tch vector.Tch vector ca hai vector
Hm Cosec
csc
Hm Cosec Hyperbolic
csch
Hm du ca biu thc s phc
csgn
Tnh rota ca vc t v
curl
Ton t o hm (ca hm 1 bin) v o hm
D, D[i]
theo bin th i (ca hm nhiu bin
x
dawson
2
x2
Tch phn Dawson( x) = e et dt

collect(a,x)
comparray(A,B)
compoly(r)
conjugate(expr)
content(a,x)

convert(expr,fo
rm)
cos(x)
cosh(x)
cost(a)
cot(x)
coth(x)
crossprod(u,v)
csc(x)
csch(x)
csgn(a)
curl(v)
D(f),
D[i](f)
dawson(x)

degree
denom
depends
DESol
DEplot

DEplot3d

det
Diff

216

Bc ca a thc
Ly mu s (ca mt phn thc)
Xc nh tch phn ph thuc ca f vo
(cc) bin x
Tp nghim ca phng trnh vi phn (gii
theo y)
V th nghim phng trnh hoc h
phng trnh vi phn

degree(a,x)
denom(e)
depends(f,x)

V th nghim phng trnh hoc h


phng trnh vi phn trong khng gian 3
chiu
Tnh nh thc ca ma trn vung A
Ly o hm hoc o hm ring lnh tr

DEplot3d(deqns,va
rs,range,
initset,options)

DESol(expr,y)
DEplot(deqns,
vars,range,
inits,eqns)

det(A)
Diff(f,x1,...,

xn)
diff

dilog

Ly o hm hoc o hm ring ca hm s diff(a,x,y..)


a, bc 1 hoc bc cao
diff(a,x$m,y$n
..)
x
dilog(x)
ln(t )
Hm Dilogarit dilog ( x) =
dt
1 t
1

Dirac

Hm Delta Dirac, tc l hm bng 0 khp


ni, tr ti gc v c tch phn bng 1.
o hm cp n ca hm Delta Dirac
Tm nhng im gin on ca hm s thc
Tnh discriminant ca a thc

Dirac(t)
Dirac(n,t)

discont
discont(f,x)
discrim
discrim(p,x)
dismantle Cho xem cu trc d liu ca biu thc (expr) dismantle(exp
r)
Divide
Kim tra tnh chia ht ca a thc a (nhiu Divide(a,b,'q')
bin) cho a thc b (nhiu bin) v nu ng
th c th cho bit thng 'q' .
divide
Kim tra tnh chia ht ca 2 a thc (v cho bit divide(a,b,q)
thng nu cn)
Tnh
tch v hng ca 2 vector u,v, nu c
dotprod
dotprod(u,v,
bin orthogonal th tch v hng c tnh
orthogonal)
nh tng ca cc tch u[i]*v[i]
dsolve
Gii phng trnh vi phn (vi cc kh nng dsolve(deqns,va
v phng php khc nhau n nh bi rs),
dsolve(deqns,va
keyword)
rs,keyword)
Ei(n,x)
Ei
Hm tch phn m, tc l
+

Ei (n, x) =

e xt t n dt = x n1(1 n, x)

Eigenvals Tnh gi tr ring v vect ring ca ma trn


s. Tnh gi tr ring v vect ring theo ngha
suy rng, ngha l tm cc gi tr L v cc vec
t X sao cho AX=LBX
eigenvals Tnh gi tr ring v vc t ring ca ma trn
s

Eigenvals(A,vecs)
Eigenvals(A,B
,vecs)

eigenvals(A,vecs)
eigenvals(A,B,vec
s)
eigenvects Tnh vector ring ca ma trn A
eigenvects(A)
eliminate Chuyn h phng trnh nhiu bin v mt h eliminate(eqns
tng ng theo phng trnh kh bin s et,vars)
(hay cn gi l phng trnh th)
ellipsoid Lnh tnh din tch ca mt ellipsoid khi bit ellipsoid(a,b
,c)
3 trc ca n.

217

EllipticC Hm tch phn Elliptic y , tc l := EllipticCE(k)


E
EllipticE (1, 1 k 2 )
EllipticCK Hm tch phn xc nh bi :=
EllipticCK(k)

EllipticF (1, 1 k 2 )
EllipticE Tch phn Elliptic khng y , tc l := EllipticE(z,k)
z

1 k 2t 2

dt
1 t 2
EllipticCP Hm tch phn xc nh bi
EllipticCPi(v
i
,k)
2
EllipticPi (1, v, 1 k )
EllipticF Tch phn Elliptic khng y loi 1, tc l := EllipticF(z,k)
0

dt

1 k t 1 t 2
EllipticK Hm tch phn xc nh := EllipticF (1, k )
EllipticPi Hm tch phn :=
0

2 2

entries

equal

erf

erfc
eulermac

Eval
eval
evala
evalb
evalc
evalf

218

dt

EllipticK(k)
EllipticPi(z,v
,k)

(1 vt ) 1 t 2 1 k 2t 2

Lnh ny thng i cng cp vi lnh indices entries(t)


v c trch nhim ch ra gi tr tng ng vi
cc index (trong mt mng)
So snh hai ma trn c bng nhau hay equal(A,B)
khng(tc l so snh xem cc phn t tng
ng c bng nhau hay khng)
x
erf(x)
2
2
Hm sai s erf ( x) =
et dt

0
Hm b sai s erfc( x) = 1 erf ( x)
Xp x tim cn Euler Maclaurin ca
Sum(expr,x). Ngha l nu
F(x) = elermac(f(x),x) th F(x+1)F(x) l
tng ng tim cn vi f(x)
nh gi (tnh gi tr) ca mt a thc ti 1
im
nh gi (tnh gi tr) ca biu thc (x)
nh gi (tnh gi tr) i s ca biu thc i
s
Tnh gi tr Boole ca biu thc logic
Tnh gi tr ca biu thc phc, tc l a n
v dng expr1 + I * expr 2
Tnh gi tr thp phn ca biu thc (vi
h h
h )

erfc(x)
eulermac(exps
,x)

Eval(a,x=n)
eval(x)
evala(expr)
evalb(x)
evalc(expr)
evalf(x),

evalm
exp

chnh xc n n ch s)
Tnh gi tr ca biu thc ma trn
x

evalf(x,n)
evalm(expr)
exp(x)

frac

Hm s m exp( x) := e
Khai trin (biu thc)
Khai trin biu thc expr (nhng khng khai
trin cc biu thc con expr 1,..., expr n
trong expr
Phn tch mt a thc (nhiu bin) ra tha s
trn trng m rng i s K
Phn tch biu thc (i s ) ra tha s
Tng t lnh trn, nhng cho kt qu di
dng d liu [u,[[f1,e1],...,[fn,en]]], trong u
l h s u, fi l cc a thc nguyn thu bt
kh quy, ei l bi tng ng
Phn tch a thc nhiu bin ra tha s
Bin i Fourier nhanh i vi mt lit s
phc c di 2m, vi dy phn thc l x v
dy phn o l y)
Ly phn thp phn ca s x

Frobenius

Tm dng Frobenius ca ma trn (A)

fsolve

Gii phng trnh tm nghim di dng s fsolve(eqns,va


rs,opitions)
thp phn (k c nghim phc).

galois

Tnh nhm Galoa ca 1 a thc bt kh quy 1 galois(f)


bin (bc 7 tr xung)
Hm xc nh theo cng thc
GAMMA(z)

Expand
expand

Factor
factor
Factors

factors
FFT

GAMMA

Expand(a)
expand(expr,exp
r1,...,exprn)
Factor(a,K)
factor(a)
Factors(a,K)

factors(a)
FFT(m,x,y)

frac(x)
Frobenius(A)

( z ) := et t ( z1) dt vi z na bn phi
0

GaussAGM

mt phng phc, v c thc trin gii tch


sang na mt phng tri.
Ly trung bnh Gauss ca 2 s (a v b), tc l GaussAGM(a,b)
ly
gii
hn
ca
qu
trnh
lp a0 = a, b0 = b ,
an+1 =

an + bn
an bn
.
, bn+1 = (an + bn )
2
(an + bn )2

(S ny lun nm gia trung bnh cng v


trung bnh nhn ca a v b).
Gaussejor a ma trn v dng Gauss-Jordan bng
Gaussejordan(A)
php kh Gauss-Jordan.
dan

219

a ma trn v dng tam gic bng php kh


Gauss.
Gcd
Tm c s chung ln nht ca 2 a thc (a v
b) v cho bit thng ca chng i vi c
chung ny (nu cn)
gcd
Tm c s chung ln nht ca cc a thc
Dng thut ton Euclid m rng tm c s
Gcdex
chung ln nht vi h s u (theo bin x) bng
n v ca 2 a thc a v b v ng thi cho
bit cc a thc s (c bc nh hn bc ca b)
v t (c bc nh hn bc ca a) tho mn as
+ bt = g, nu cn.
gcdex
S dng thut ton Euclid suy rng tm
gcd(a,b) v cc a thc s v t sao cho
s * A + t * B = g trong g l c s chung
ln nht ca 2 a thc (theo mt bin x) A,B,
v bc ca s nh hn bc ca B, bc ca t nh
hn bc ca A.
genematrix Lp ma trn t cc h s ca phng trnh. Nu
c bin th ba flag th vector v phi c
a vo ct cui ca ma trn
geneqns
Lp phng trnh trn t cc h s ca ma trn.
Nu c bin th 3 biu th vectorb th n s
a vo v phi ca phng trnh
Sinh mt a thc a( x) trn Z [ x] vi cc h s
genpoly
b
nh hn
sao cho a(b) = n, khi n l mt s
2
nguyn. Khi n l mt a thc theo mt bin
khc (y) vi h s nguyn th mi h s ca a
thc ny s sinh mt a thc (theo x) vi
nguyn tc trn.
Tnh o hm ca hm nhiu bin
grad
Gausselim

Gausselim(A)
Gcd(a,b,'s','t')

gcd(a,b)
Gcdex(a,b,x,'s',
't')

gcdex(A,B,x,
s,'t)

genematrix(eqn
s,vars,flag)
geneqns(A,x,b)

genpoly(n,b,x)

grad(f,[x,y,z
])
GramSchmi Tm c s trc chun ca khng gian sinh bi
GramSchmidt(
mt h cc vc t
dt
u1,u2,...,un)
HankelH1 Hm s Hankel, c nh ngha := BesselJ(v,x) HankelH1(v,x)
+ I.BesselY(v,x).
HankelH2 Hm s Hankel, c nh ngha := BesselJ(v,x) HankelH2(v,x)
- I.BesselY(v,x).
Hm
iu ho (tc l hm ( x + 1) + , m
harmonic(x)
harmonic
x = n l s nguyn th ta c

220

1
i=1 i

(n + 1) + =
has
hasfun
Heaviside

Hermite
hessian
icontent
iFFT

Kim tra xem trong biu thc f c thnh has(f,x)


phn x hay khng.
Kim tra xem trong biu thc e c hm f hasfun(e,f)
khng.
L mt nguyn hm ca hm Dirac, nhn gi Heaviside(x)
tr 0 trn na trc s m v nhn gi tr 1 trn
na trc s dng (khng xc nh ti gc).
Tm dng chun tc Hermite ca ma trn
Hermite(A,x)
hessian(f,[x,y
Tnh hessian ca hm f
,z])
Tm c s chung ln nht ca cc h s ca icontent(expr
a thc
Bin i Fourier ngc ca cc dy s x, y iFFT(m,x,y)
cng c di 2m

ifactor

Phn tch s nguyn ra tha s nguyn t

ifactor(n)

igcd
igcdex

igcd(x1,x2,...)
c chung ln nht ca cc s nguyn
Dng thut ton Euclid tm 2 s s,t tho iu igcdex(a,b,s
,t)
kin sa + tb = gcd( a, b)

ilcm

Bi s chung nh nht ca cc s nguyn

ilcm(x1,x2,...
)
Tnh
Lgarit
nguyn
c
s
b
ca
x
,
tc
l
tm
ilog[b](x)
ilog
s nguyn r sao cho b r x < b r +1
Tnh s lgarit nguyn c s 10 ca x
ilog10(x)
ilog10
Phn o ca mt biu thc phc x
Im
Im(x)
implicitd Ly o hm ca hm n xc nh bi phng implicitdiff(f
trnh, hoc h phng trnh. Trong trng hp ,x,y)
iff
sau ny ta thu c tp hm s implicitdiff({
{ y1 , y2 ,..., yn } v ta c th ly o hm ch ca f1,...fm},{y1,
mt nhm trong s hm ny (th d l ...yn},{u1,...
ur},x1,...xk})
{u1 , u2 ,..., ur } ) theo {x1 , x2 ,..., xk } )
implicitp V th hm n
implicitplot(
lot
f(x,y),x=a..b
, y=c..d)
Tm cc bin khng xc nh (t do) ca 1 indets(expr)
indets
biu thc
Lnh thng k tp cc ch s ca bng (mng) indices(t)
indices
innerprod Tnh tch trong ca mt dy cc ma trn v
innerprod(A,B
),innerprod(u
vector
,v)

221

Int

int

Ly tch phn(bt nh hoc xc nh) ca


hm s, nhng khng hin th cng thc (lnh
tr)
Ly tch phn (bt nh hoc xc nh) ca
hm s

Int(f,x)
Int(f,x=a..b)

int(f,x)
int(f,x=a..b)
Interp
Ni suy a thc, tc l a ra a thc (bin x) Interp(a,b,x)
nhn cc gi tr l cc thnh phn ca vect b
trn tp cc im l thnh phn ca vect b.
Ni suy a thc v t tn cho bin ca n l interp(x,y,v)
interp
v
Tnh ma trn ngc ca ma trn A theo Inverse(A)mod
Inverse
modulo n
n
Tnh ma trn ngc ca ma trn vung A
inverse
inverse(A)
Ly hm ngc ca mt hm f
invfunc[f]
invfunc
invztrans Ly ngc ca bin i Z ca hm f(z) i invztrans(f,z
vi n
,n)
Tm thng nguyn (ca 2 s nguyn) v cho iquo(m,n)
iquo
bit s d r khi cn
iquo(m,n,r)
Tm phn d trong php chia 2 s nguyn v irem(m,n)
irem
cho bit thng khi cn
irem(m,n,q)
Tm xp x nguyn cho cn bc n ca x
iroot(x,n)
iroot
Irreduc
Irreduc(a)
Kim tra tnh bt kh quy ca mt a thc
nhiu bin (a)
Kim tra tnh bt kh quy ca mt a thc
irreduc
irreduc(a)
Kim tra tnh lin tc ca hm trn khong iscont(expr,x
iscont
( a, b)
=a..b)
isdiffere Kim tra tnh kh vi v trn ca mt hm isdifferentiabl
ntiable
s v trong trng hp n khng thuc C ( n ) e(expr,vars,cla
th tham s d cho bit n thuc lp C ( k ) ss)
no v nhng im ti khng c o hm isdifferentiabl
e(expr,vars,cla
cp ( k + 1 ).
ss, d)
Gii phng trnh eqn theo biu thc expr
isolate
isolate(eqn,ex
pr)
Kim tra c tnh a thc f (loi g ? bc no ispoly(f,kind
ispoly
? gi tr ca tng h s ?)
,x)
Tm xp x nguyn cho cn bc 2 ca s t isqrt(n)
isqrt
nhin n
Issimilar Kim tra tnh ng dng ca 2 ma trn A v B Issimilar(A,B)
Kim tra xem mt s c phi l chnh phng issqr(n)
issqr
(bnh phng ca mt s khc) hay khng ?
jacobian Tnh o hm ca mt vc t
jacobian(v,[x

222

Lcm
lcm
lcoeff
LegendreE

lhs
Li

Tm bi s chung nh nht ca cc a thc


Tm bi s chung nh nht ca cc a thc
hu t
Tm h s u ca a thc (nhiu bin)
Hm Legendre, cng chnh l hm EllipticE
ni trn (theo tn gi mi). (Tng t
nh vy i vi cc hm Legendre khc nh :
LegendreF, LegendrePi, ...)
Ly v tri ca phng trnh (hoc biu thc c
2 v hay 2 phn)
Hm tch phn Lgarit, tc l hm := Ei(ln(x))
x

:= pv
0

Limit

limit

linsolve
ln
lnGAMMA
log
log10
lprint
map
matrix
max
maximize
maxnorm

, y, z])
Lcm(a,b,...)
lcm(a,b,...)
lcoeff(p)
LegendreE(k,z)

lhs(expr)
Li(x)

dt
, trong pv l gi tr chnh
ln(t )

Gauss
Tnh gii hn, hoc gii hn theo hng lnh Limit(f,x=a)
tr
Limit(f,x = a
,direct)
Tm gii hn, hoc gii hn theo hng
limit(f,x=a)
limit(f,x=a,
direct)
Gii phng trnh i s tuyn tnh Ax = u
linsolve(A,u)
Ly Lgarit c s t nhin (e)
ln(x)
Ly Lgarit c s t nhin ca hm Gamma, lnGAMMA(x)
tc l ln(( x))
Hm Lgarit tng qut, c s b dng 1
bt k
Lgarit c s 10
Chuyn biu thc (cng thc) v dng text 1
chiu
Thc hin mt php ton trn nhiu thnh
phn
Lp ma trn cp mxn, hoc to lp ma trn
mxn t bng L

log[b](a)
log10(x)
lprint(g)

map(f,expr,arg
1,arg2,..)
matrix(m,n)
matrix(m,n,L)
Tm i lng ln nht trong cc i lng max(x1,x2,...)
( x1 , x2 ,... )
Tm gi tr ln nht ca biu thc expr, theo maximize(expr
cc bin vars, trn cc min ranges
,vars,ranges)
Tnh chun max ca a thc, tc l tnh h maxnorm(a)

223

member
min
minimize
minpoly

modp
modp1

modp2
mods
Normal
msolve

s c tr tuyt i ln nht trong s cc h s


ca a thc.
Kim tra xem thnh phn x c trong danh member(x,s)
mc s hay khng
Ly i lng nh nht trong cc i lng min(x1,x2,...)
( x1 , x2 ,... )
Tnh gi tr nh nht ca biu thc

minimize(expr
,vars,ranges)
Tm a thc bc khng qu n, vi h s minpoly(r,n)
nguyn nh nht v nhn xp x r ca mt s
i s lm nghim ca n
Tnh modulo m (tm ng d) ca biu thc e, modp(e,m)
s dng biu din dng
Tnh ton modulo m cho a thc 1 bin e (bng modp1(e,m)
mt thut ton ring c hiu qu c bit cho
trng hp a thc mt bin)
Tnh modulo m cho a thc 2 bin (bng mt modp2(e,m)
thut ton c th cho a thc 2 bin)
Tnh modulo m s dng biu din i xng
mods(e,m)
Tm dng chnh tc (ca mt phn thc)
Normal(a)
Gii phng trnh trn mod p

msolve(eqns,var
s,p)
Tnh khai trin Taylor nhiu bin ca f theo mtaylor(f,V,n)
mtaylor
v bc n
mul
mul(f,i=m..n)
Ly tch ca mt dy s
Nullspace Tm c s ca nhn (Kernel) ca ton t ( ma Nullspace(A)
trn) mod p
mod p
nullspace Tm c s ca nhn (Kernel) ca ton t ( ma nullspace(A)
trn)
multiply Nhn 2 ma trn, 2 vector hoc nhn ma trn multiply(A,B)
vi vec tor
multiply(A,v)
multiply(u,v)
nextprime Tm s nguyn t ngay sau s cho
nextprime(x)
nops
norm

Tr li s lng cc thnh phn ca mt nops(exps)


biu thc
Tnh chun bc n ca biu thc a theo bin norm(a,n,v)
n

v tc l bng ( c ) n , trong tng c


ly theo tt c cc h s c ca a.
normal

224

a mt biu thc ( f ) v dng chun ho

normal(f)

numboccur Tnh s ln xut hin ca biu thc (e) trong numboccur(f,e)


biu thc f
numer(e)
numer
Ly t s ca mt phn thc (e)
op

Trch ra mt s thnh phn ca biu thc

order
parse

Ly bc ca thnh phn d trong biu thc order(expr)


dng chui
parse
Phn tch cu, phn tch xu k t,...

pdesolve

Gii phng trnh o hm ring

PDEplot

V th nghim ca phng (hoc h) trnh


o hm ring

piecewise Thit lp hm tng khc: trn vng dk1 th


nhn gi tr l hm f1,..., trn vng dkn nhn
hm fn, cn li nhn gi tr l hm f
plot
V th trong khng gian 2 chiu ca hm
s 1 bin y = f ( x) trong min hnh ch nht
[a, b][c, d ]

op(i, exps)

pdesolve(eqns
,vars)
PDEplot(eqns,
var,i_curve,
range,options)
piecewise(dk1
,f1,dk2,f2,..
.,dkn,fn,f)
plot(f,x=a..b
,y=c..d)

plot3d

V th trong khng gian 3 chiu ca cc plot3d(expr,x


=a..b,y=c..d)
mt 2 chiu
pochhamme Hm s xc nh bi cng thc
pochhammer(z,
( z + a )
r
a)
Pochhammer( z , a ) =
( z )
Khai trin hm (nhiu bin) thnh chui poisson(f,v,n)
poisson theo bin v, bc n,...
Biu din s phc di dng to cc
polar
polar(z)
V

th
dng
to

cc
polarplot
polarplot(L,o
ptions);
Hm
s
Lgarit
bi,
tc
l
thc
trin
gii
tch
polylog
polylog(a,z)
n
z
ca hm a khi z < 1
n=1 n
Ly tha (bc n) ca mt a thc (a) mod p Power(a,n)mod
Power
p
Lu tha bc n ca mt a thc (a)
power
power(a,n)
Tnh ng d (theo modul p) ca ly tha
Powemod(a,n,p)
Powmod
(bc n) ca mt a thc (a). (Php tnh ny
s dng mt thut ton khc, hu hiu hn
hn, so vi th tc thng thng l tnh ng
d sau khi thc hin xong cng on tnh
ly tha)
poisson

225

Tnh modulo b(x) ca biu thc [a ( x)]n

powmod(a,n,b,
x)
prevprime Tm s nguyn t ln nht b hn s cho prevprime(n)
Primitive Kim tra tnh nguyn thu ca mt a thc
Primitive(a)
primpart Phn nguyn thu (ca a thc)
primpart(a,x)
Tch ca cc s (hoc biu thc)
product
product(f,k=n.
.m)
Tm cn bc 2 ca biu thc a nu a l chnh psqrt(a)
psqrt
phng, ngc li th cho kt qu l khng c
cn
Tm thng trong php chia ca 2 a thc a
quo(a,b,x,r)
quo
cho b v cho bit phn d r nu cn
randpoly Sinh a thc mt cch ngu nhin
randpoly(x)
Tnh hng ca ma trn A
rank
rank(A)
rationaliz Trc cn thc mu
rationalize(ex
e
pr)
realroot Cho bit cc khong (vi b rng = width) c realroot(poly
cha nghim thc ca a thc poly
,width)
recipoly Kim tra xem a thc c tnh cht i trng recipoly(a,x)
hay khng, tc l cc h s i xng nhau qua
n thc gia
Tnh phn d trong php chia ca 2 a thc v rem(a,b,x,q)
rem
cho bit thng q nu cn
residue
Tnh h s ca thnh phn ( x a )1 trong residue(f,x=a)
powmod

rhs
root

roots
round
rsolve
sec
sech
seq

226

khai trin Laurent ca f ti x = a


Ly v phi ca biu thc (c 2 v).
rhs(expr)
Khai cn bc n ca biu thc (x). Lnh ny root(x,n)
cho ta gi tr chnh trong s n gi tr ca cn
(tc l gi tr u tin k t trc s thc dng
theo chiu ngc kim ng h).
Tnh tt c cc nghim ca mt a thc (a) roots(a)
theo bin x
Hm lm trn s (bng cch ly s nguyn round(x)
gn n nht)
rsolve(eqns,fc
Gii phng trnh truy hi
ns)
sec(x)
Hm s lng gic Sec(x)
Hm s Sec Hyperbolic
To mt lit t cc gi tr ca hm s f

sech(x)
seq(f,i=m..n)

series
sign
signum
simplify
sin
singular

sinh
sinterp
solve
sort
spline
split
splits

Khai trin biu thc expr thnh chui ti xung


quanh im a
Hm s xc nh du ca h s u trong biu
thc
Hm du ca mt i lng
n gin biu thc
Hm s lng gic Sin(x)
Tm cc im k d ca biu thc. Nu biu
thc ph thuc 1 bin th kt qu cho ta cc
im k d. Nu biu thc ph thuc 2 bin
th kt qu cho ra l cc hm (vect 2 chiu)
biu din tp im k d.
Hm lng gic Hyperbolic Sin
Ni suy a thc tha
Gii phng trnh hoc h phng trnh

series(expr,x
=a)
sign(a)
signum(z)
simplify(expr)
sin(x)
singular(expr
,vars)

sinh(x)
sinterp
solve(eqns1(x),
eqns2(y),{x,y})
Sp xp cc s hng, sp xp mt biuthc, sort(exps,var
s,tdeg)
sp xp mt danh sch
Tnh a thc tng khc (spline) xc nh bi spline(X,Y,z,
cc gi tr X, Y cho trc, c bc l d v bin z d)
Phn tch hon ton a thc ra cc a thc bc split
nht
splits
Tng t nh trn

sqrt

sqrt(a)

subs

subs(x=a,expr)

Hm cn bc 2
Thay th x (trong biu thc expr) bi biu
thc a
substring Trch mt xu k t t mt xu k t cho
trc
Ly tng cc s hng
sum
surd

symmdiff
tan
tanh
thiele
trunc

substring(str
ing,a..b)
sum(f,k)
sum(f,k=n..m)
Ly gi tr cn bc n ca x, nhng khng phi surd(x,n)
l gi tr chnh, m l gi tr c argument gn
vi argument ca x nht
Hiu i xng gia 2 tp A v B
symmdiff(A,B)
Hm lng gic tg(x)
tan(x)
Hm lng gic Hyperbolic
tanh(x)
Hm ni suy phn thc
thiele(x,y,v)
Hm lm trn mt s v vi s nguyn k n trunc(x)
(theo hng v s 0)

227

unapply

Kim tra biu thc xem c cu trc kiu


typename(cu trc l +, - *,/,^)
Xc nh hm s (t biu thc v cc bin)

value
vectlap

Tnh gi tr (ca mt biu thc tr f )


Tnh vc t laplacian ca vc t v

vector
whattype
with

Lnh to vc t
Cho bit cu trc ca mt biu thc
Xc nh tn hm gi ra t Library Package

type

228

type(typename)
unapply(expr,
x,y,...)
value(f)
vectlap(v,[x,
y,z])
vector(list)
whattype(exps)
with(package)

You might also like