Polynomial Menu - HP 50g User Manual

LGCD (Greatest Common Denominator): PROPFRAC (proper fraction)
SIMP2:
The functions associated with the ARITHMETIC submenus: INTEGER,
POLYNOMIAL, MODULO, and PERMUTATION, are the following:
INTEGER menu
EULER
IABCUV
IBERNOULLI
ICHINREM
IDIV2
IEGCD
IQUOT
IREMAINDER
ISPRIME?
NEXTPRIME
PA2B2
PREVPRIME

POLYNOMIAL menu

ABCUV
CHINREM
CYCLOTOMIC n-th cyclotomic polynomial
DIV2
EGDC
Number of integers < n, co -prime with n
Solves au + bv = c, with a,b,c = integers
n-th Bernoulli number
Chinese reminder for integers
Euclidean division of two integers
Returns u,v, such that au + bv = gcd(a,b)
Euclidean quotient of two integers
Euclidean remainder of two integers
Test if an integer number is prime
Next prime for a given integer number
Prime number as square norm of a complex number
Previous prime for a given integer number
Bézout polynomial equation (au+bv=c)
Chinese remainder for polynomials
Euclidean division of two polynomials
Returns u,v, from au+bv=gcd(a,b)
Page 5-10