gives the polynomial poly reduced modulo m.
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.
Examplesopen allclose all
Properties & Relations (5)
PolynomialRemainder considers all polynomials to be univariate in the specified variable:
For multivariate polynomials, PolynomialMod picks its own variable order:
PolynomialRemainder considers parameters to be invertible:
PolynomialMod does not invert symbolic expressions: