# Congruences

Solve linear congruences, compute modular roots

### Note

MuPAD® notebooks will be removed in a future release. Use MATLAB® live scripts instead.

To convert a MuPAD notebook file to a MATLAB live script file, see `convertMuPADNotebook`. MATLAB live scripts support most MuPAD functionality, although there are some differences. For more information, see Convert MuPAD Notebooks to MATLAB Live Scripts.

 `div` Integer part of a quotient `mod` Modulo operator `numlib::cornacchia` Cornachia's algorithm `numlib::ichrem` Chinese remainder theorem for integers `numlib::jacobi` Jacobi symbol `numlib::legendre` Legendre symbol `numlib::lincongruence` Linear congruence `numlib::mroots` Modular roots of polynomials `numlib::msqrts` Modular square roots

## Topics

Congruences

If `a`, `b`, and `m` are integers, and `(a - b)/m` is also an integer, then the numbers `a` and `b` are congruent modulo `m`.

Modular Arithmetic

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

#### Mathematical Modeling with Symbolic Math Toolbox

Get examples and videos