This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: LECTURE 18: CONGRUENCE MODULO n ( 8.5) In battling evil, excess is good; for he who is moderate in announcing the truth is presenting half-truth. He conceals the other half out of fear of the peoples wrath. Kahlil Gibran (1883 - 1931) Theorem 1. Let n Z with n 2 . Congruence modulo n is an equivalence relation on Z . Proof 1. Two elements are congruent modulo n if and only if they have the same remainder when dividing by n . So congruence modulo n partitions Z according to remainders. Proof 2. We first show that this relation is reflexive. Let a Z . We want to show a a (mod n ). In other words, we want n | ( a- a ) = 0. This holds since 0 = n 0. Thus a relates to a . We next show that this relation is symmetric. Let a,b Z and assume a b (mod n ). This means n | ( a- b ). In other words a- b = nk for some k Z . We want b a (mod n ), or in other words we want n | ( b- a ). In other words, we want b- a = n for some Z . But we have b- a =...
View Full Document
- Spring '11