PolynomialMod

PolynomialMod[poly,m]

gives the polynomial poly reduced modulo m.

PolynomialMod[poly,{m1,m2,}]

reduces modulo all of the mi.

Details and Options

  • PolynomialMod[poly,m] for integer m gives a polynomial in which all coefficients are reduced modulo m.
  • When m is a polynomial, PolynomialMod[poly,m] reduces poly by subtracting polynomial multiples of m, to give a result with minimal degree and leading coefficient.
  • PolynomialMod gives results according to a definite convention; other conventions could yield results differing by multiples of m.
  • Unlike PolynomialRemainder, PolynomialMod never performs divisions in generating its results.

Examples

open allclose all

Basic Examples  (2)

Reduce a polynomial modulo 2:

In[1]:=
Click for copyable input
Out[1]=

Reduce a polynomial modulo another polynomial:

In[1]:=
Click for copyable input
Out[1]=

Scope  (4)

Options  (3)

Applications  (1)

Properties & Relations  (5)

See Also

PolynomialGCD  Mod  PolynomialRemainder  PolynomialReduce  GroebnerBasis  ShiftRegisterSequence

Tutorials

Introduced in 1991
(2.0)