{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lecnotes3-1

# lecnotes3-1 - Lecture Notes Concepts of Mathematics(21-127...

This preview shows pages 1–2. Sign up to view the full content.

Lecture Notes, Concepts of Mathematics (21-127) Lecture 1, Recitation A–D, Spring 2008 3 Congruences 3.1 Congruence READ: Textbook pages 57–63. EXERCISES: Pages 82–88, #1–26, 56–68. Definition 3.1 Let m be a fixed positive integer. If a, b Z , we say that “ a is congruent to b modulo m ” and write a b ( mod m ) whenever m | ( a - b ) . If m ( a - b ) , we write a b ( mod m ) . The condition for a to be congruent to b modulo m is equivalent to: there exists an integer k such that a = b + km . Example 3.1 We have 7 3 ( mod 4) , - 6 14 ( mod 10) 4 ( mod 10) , 121 273 ( mod 2) 1 ( mod 2) ≡ - 1 ( mod 2) . Also 5 4 ( mod 3) and 21 10 ( mod 2) . Congruence arithmetic is perhaps most familiar as a generalization of the arithmetic of the clock. Since there are 60 minutes in an hour, “minute arithmetic” uses a modulus of m = 60. If one starts at 40 minutes past the hour and then waits another 35 minutes, 40 + 35 = 15 (mod 60), so the current time would be 15 minutes past the (next) hour. Similarly, “hour arithmetic” on a 12-hour clock uses a modulus of m = 12, so 10 o’clock (a.m.) plus five hours gives 10 + 5 = 3 (mod 12), or 3 o’clock (p.m.). We will find many other uses for congruences in the rest of this chapter. Proposition 3.1 (3.11) Let a, b, c be integers. Then (i) a a ( mod m ) . (ii) If a b ( mod m ) , then b a ( mod m ) . (iii) If a b ( mod m ) and b c ( mod m ) , then a c ( mod m ) . Proof: (i) Since a - a = 0 and m | 0, it follows that a a (mod m ). (ii) If a b (mod m ), then m | ( a - b ). This implies m | ( - 1)( a - b ) = ( b - a ), or b a (mod m ).

This preview has intentionally blurred sections. Sign up to view the full version.

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

{[ snackBarMessage ]}

### Page1 / 4

lecnotes3-1 - Lecture Notes Concepts of Mathematics(21-127...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online