CSE115ENGR160 Discrete Mathematics031312.ppt

* * * * * * * * * * * * * * * * * * * * * CSE115/ENGR160 Discrete Mathematics03/13/12 Ming-Hsuan Yang UC Merced * 4.1 Divisibility and modular arithmetic Number theory: the branch of mathematics involves integers and their properties If a and b are integers with a≠0, we say that a divides b if there is an integer c s.t. b=ac When a divides b we say that a is a factor of b and that b is a multiple of a The notation a | b denotes a divides b. We write a ? b when does not divide b * Example Let n and d be positive integers. How many positive integers not exceeding n are divisible by d? The positive integers divisible by d are all integers of them form dk, where k is a positive integer Thus, there are positive integers not exceeding n that are divisible by d * Theorem and corollary Theorem: Let a, b, and c be integers, then If a | b and a| c, then a | (b+c) If a | b, and a | bc for all integers c If a | b and b | c, then a | c Corollary: If a, b, and c are integers s.t. a | b and a | c, then a | mb+nc whenever m and n are integers * The division algorithm Let a be integer and d be a positive integer. Then there are unique integers q and r with 0 ≤ r d, s.t. a=dq+r In the equality, q is the quotient, r is the remainder q = a div d, r = a mod d -11 divided by 3 -11=3(-4)+1, -4=-11 div 3, 1=-11 mod 3 -11=3(-3)-2, but remainder cannot be negative * Modular arithmetic If a and b are integers and m is a positive integer, then a is congruent to b modulo m if m divides a-b We use the notation a≡b (mod m) to indicate that a is congruent to b modulo m If a and b are not congruent modulo m, we write a ?b (mod m) Let a and b be integers, m be a positive integer. Then a≡b (mod m) if and only if a mod m = b mod m * Example Determine whether 17 is congruent to 5 modulo 6, and whether 24 and 14 are not congruent modulo 6 17-5=12, we see 17≡5 (mod 6) 24-14=10, and thus 24?14 (mod 6) * Theorem Karl Friedrich Gauss developed the concept of congruences at the en