next up previous
Next: Binary Representations Up: Tools Previous: Recursion

Congruence of Integers Modulo n

If two integers a and b have the same remainder when divided by positive integer n, then we say that a and b are congruent modulo n. This is written tex2html_wrap_inline1367 (mod n). For example, tex2html_wrap_inline1371 (mod 3). It is not hard to see that tex2html_wrap_inline1367 (mod n) is equivalent to a-b being a multiple of n.

Carl Lee
Wed Apr 21 08:17:28 EDT 1999