Wolfram ResearchPRODUCTSPURCHASEFOR USERSCOMPANYOUR SITES
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.

PolynomialMod

Usage

PolynomialMod[poly, m] gives the polynomial poly reduced modulo m.
PolynomialMod[poly, { ,  , ... }] reduces modulo all of the  .


Notes

PolynomialMod[poly, m] for integer m gives a polynomial in which all coefficients are reduced modulo m.
• Example: PolynomialMod[3x^2 + 2x + 1, 2]LongRightArrow .
• 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 Section 3.3.4.
• Related package: Algebra`PolynomialPowerMod`.
• New in Version 2.


Any questions about topics on this page? Click here to get an individual response.Buy NowFree TrialMore Information



 © 2009 Wolfram Research, Inc.  Terms of Use  Privacy Policy |
Sign up for our newsletter: