Mod[m, n] gives the remainder on division of m by n. Mod[m, n, d] uses an offset d.

PowerModList[a, s/r, m] gives a list of all x modulo m for which x^r \[Congruent] a^s mod m.

PowerMod[a, b, m] gives a^b mod m. PowerMod[a, -1, m] finds the modular inverse of a modulo m.PowerMod[a, 1/r, m] finds a modular r\[Null]^th root of a.

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

Mathematica's extensive base of state-of-the-art algorithms, efficient handling of very long integers, and powerful built-in language make it uniquely suited to both research ...

Mathematica includes a very large collection of mathematical functions. "Mathematical Functions" gives the complete list. Here are a few of the common ones. Some common ...

CellChangeTimes is an option to Cell that specifies when changes were made to the cell.

Mathematica can work with polynomials whose coefficients are in the finite field Z_p of integers modulo a prime p. Functions for manipulating polynomials over finite fields. ...

Mathematica contains hundreds of original algorithms for computing integer functions involving integers of any size.

Some integer functions. The remainder on dividing 17 by 3. The integer part of 17/3.