Page 5-11
IABCUV Solves au + bv = c, with a,b,c = integers
IBERNOULLI n-th Bernoulli number
ICHINREM Chinese reminder for integers
IDIV2 Euclidean division of two integers
IEGCD Returns u,v, such that au + bv = gcd(a,b)
IQUOT Euclidean quotient of two integers
IREMAINDER Euclidean remainder of two integers
ISPRIME? Test if an integer number is prime
NEXTPRIME Next prime for a given integer number
PA2B2 Prime number as square norm of a complex number
PREVPRIME Previous prime for a given integer number
POLYNOMIAL menu
ABCUV Bézout polynomial equation (au+bv=c)
CHINREM Chinese remainder for polynomials
CYCLOTOMIC n-th cyclotomic polynomial
DIV2 Euclidean division of two polynomials
EGDC Returns u,v, from au+bv=gcd(a,b)
FACTOR Factorizes an integer number or a polynomial
FCOEF Generates fraction given roots and multiplicity
FROOTS Returns roots and multiplicity given a fraction
GCD Greatest common divisor of 2 numbers or polynomials
HERMITE n-th degree Hermite polynomial
HORNER Horner evaluation of a polynomial
LAGRANGE Lagrange polynomial interpolation
LCM Lowest common multiple of 2 numbers or polynomials
LEGENDRE n-th degree Legendre polynomial
PARTFRAC Partial-fraction decomposition of a given fraction
PCOEF (help-facility entry missing)
PTAYL Returns Q(x-a) in Q(x-a) = P(x), Taylor polynomial
QUOT Euclidean quotient of two polynomials
RESULTANT Determinant of the Sylvester matrix of 2 polynomials
REMAINDER Euclidean reminder of two polynomials
STURM Sturm sequences for a polynomial
STURMAB Sign at low bound and number of zeros between bounds
To Next Page
Loading...
