Mathematica 9 is now available
Previous section-----Next section

3.3.5 Polynomials Modulo Primes

Mathematica can work with polynomials whose coefficients are in the finite field  of integers modulo a prime  .

PolynomialMod[poly, p] reduce the coefficients in a polynomial modulo p
Expand[poly, Modulus -> p] expand poly modulo p
Factor[poly, Modulus -> p] factor poly modulo p
PolynomialGCD[ ,  , Modulus -> p]
find the GCD of the  modulo p
GroebnerBasis[polys, vars, Modulus -> p]
find the Gröbner basis modulo p

Functions for manipulating polynomials over finite fields.
Here is an ordinary polynomial.

In[1]:=  Expand[ (1 + x)^6 ]

Out[1]=

This reduces the coefficients modulo 2.

In[2]:=  PolynomialMod[%, 2]

Out[2]=

Here are the factors of the resulting polynomial over the integers.

In[3]:=  Factor[%]

Out[3]=

If you work modulo 2, further factoring becomes possible.

In[4]:=  Factor[%, Modulus->2]

Out[4]=



Any questions about topics on this page? Click here to get an individual response.Buy NowMore Information
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.