This is documentation for Mathematica 3, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.2)
 Documentation / Mathematica / Built-in Functions / Algebraic Computation / Polynomial Functions  /
PolynomialMod

  • PolynomialMod[ poly , m ] gives the polynomial poly reduced modulo m.
  • PolynomialMod[ poly , , , ... ] reduces modulo all of the .
  • PolynomialMod[ poly , m ] for integer m gives a polynomial in which all coefficients are reduced modulo m.
  • Example: PolynomialMod[3x^2 + 2x + 1, 2].
  • 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.
  • See the Mathematica book: Section 3.3.4.
  • See also: PolynomialGCD, Mod, PolynomialRemainder, PolynomialReduce, GroebnerBasis.
  • Related package: Algebra`PolynomialPowerMod`.

    Further Examples

    PolynomialMod is an extension of Mod.

    In[1]:=

    Out[1]=

    In[2]:=

    Out[2]=

    See the Further Examples for PolynomialReduce.