Congruent (modular arithmetic)

Revision as of 20:20, 30 May 2011 by Djmathman (talk | contribs) (Created page with 'Congruence defines modular arithmetic. A number is congruent to <math>m \pmod{n}</math> if it leaves a remainder of <math>m</math> when divided by <math>n</math>. For instance,…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Congruence defines modular arithmetic.

A number is congruent to $m \pmod{n}$ if it leaves a remainder of $m$ when divided by $n$. For instance, $49\equiv 4 \pmod{5}$ because $49$ leaves a remainder of $4$ when divided by $5$. ($\equiv$ is the congruent sign)

This article is a stub. Help us out by expanding it.