By the Qutient-Remainder Theorem.docVIP

Summary of Week 10 Lectures 3 and 4 In the previous lecture, we introduced the basic concepts of congruence arithmetic: Definition 1: Let n ( ( and d ( (. We define n div d = the integer quotient obtained when n is divided by d. n mod d = the integer remainder obtained when n is divided by d. Definition 2: Let n????. We will define a relation on ? called congruence modulo n (denoted () by (a, b???? ( a ( b(mod n) ( n | (a - b) ). a ( b(mod n) reads “a is congruent to b modulo n”. a ( b(mod n) if and only if n divides the difference between a and b. a ( b(mod n) if and only if a mod n