This is machine translation

Translated by Microsoft
Mouseover text to see original. Click the button below to return to the English verison of the page.

Note: This page has been translated by MathWorks. Please click here
To view all translated materals including this page, select Japan from the country navigator on the bottom of this page.

Modular Arithmetic

Quotients and remainders, primitive roots, orders of residue classes, Euler's totient function, and more

MuPAD Functions

div Integer part of a quotient
mod Modulo operator
modp Positive modulo function
mods Symmetric modulo function
numlib::isquadres Test for quadratic residues
numlib::order Order of a residue class
numlib::primroot Primitive roots
numlib::reconstructRational Rational number reconstruction
numlib::sqrtmodp Square root of a quadratic residue modulo a prime
powermod Compute a modular power of a number or a polynomial
rem Remainder after division


Modular Arithmetic

Computing the quotient and the remainder of the division of two integers is a common operation in number theory.

Was this topic helpful?