Congruent (modular arithmetic): Difference between revisions

Revision as of 20:08, 30 May 2011

Redirect to:

@@ Line 1: / Line 1: @@
-Congruence defines modular arithmetic.
+#REDIRECT [[Modular arithmetic/Intermediate]]
-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, <math>49\equiv 4 \pmod{5}</math> because <math>49</math> leaves a remainder of <math>4</math> when divided by <math>5</math>.  (<math>\equiv</math> is the congruent sign)
-{{stub}}