Definition: If n is a fixed positive number and a,{}b are integers then a is congruent to b (mod-n) if a-b is divisible by n. We write![]()
The normal properties of subtraction, addition, multiplication, exponentiation are inherited from![]()
So if
then
and![]()
Congruence is an equivalence relation, since
so![]()
so
so![]()
then
and
then
hence![]()
This means that for each
the set of equivalence classes is the set![]()
![]()
If
the set of equivalence classes is
![]()
![]()
![]()
![]()
Congruences may be used in the following ways using the above rules.
Show that 37^{37} +2 is divisible by 13.
![]()
![]()
![]()
Hence
is divisible by 13.