This is documentation for Mathematica 6, which was
based on an earlier version of the Wolfram Language.
 Polynomial Algebra Polynomial algorithms are at the core of classical "computer algebra". Incorporating methods that span from antiquity to the latest cutting-edge research at Wolfram Research, Mathematica has the world's broadest and deepest integrated web of polynomial algorithms. Carefully tuned strategies automatically select optimal algorithms, allowing large-scale polynomial algebra to become a routine part of many types of computations. Polynomial Elements Basic Structural Operations Solve — find generic solutions for variables Eliminate — eliminate variables between equations Resolve — eliminate general quantifiers Reduce — reduce systems of equations and inequalities to canonical form Finite Fields Modulus — specify a modulus PolynomialMod — reduce coefficients in a polynomial GaussianIntegers — do operations over Gaussian integers Extension — specify a general algebraic extension field Root — general representation of a polynomial root MinimalPolynomial — minimal polynomial for a general algebraic number TUTORIALS Algebraic Operations on Polynomials Structural Operations on Polynomials Polynomials Modulo Primes Polynomials over Algebraic Number Fields Complex Polynomial Systems MORE ABOUT Rational Functions Polynomial Equations Polynomial Systems Diophantine Equations Finite Fields Package New in 6.0: Symbolic Computation RELATED LINKS Demonstrations related to Polynomial Algebra (The Wolfram Demonstrations Project)