PMATH340 LN8

33 theorem 7 the set 0 1 2 n 1 is a complete

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: r each integer k there corresponds an ai such that k ≡ ai (mod n). 33 Theorem 7. The set {0, 1, 2, . . . , n − 1} is a complete residue system modulo n. Proof. This is a direct consequence of the Division Algorithm. Theorem 8. Let a, b ∈ Z, then a ≡ b(mod n) if and only if a and b have the same nonnegative remainder when divided by n. Proof. Let a, b ∈ Z. Suppose a ≡ b(mod n). Then by definition n|(a − b). Now by the Division Algorithm there are q, q ￿ , r, r￿ ∈ Z with 0 ≤ r, r￿ < n so that a = qn + r and b = q ￿ n + r￿ ....
View Full Document

This note was uploaded on 02/09/2013 for the course PMATH 340 taught by Professor W.alabama during the Spring '09 term at Waterloo.

Ask a homework question - tutors are online