Math 115A Homework Assignment #6, Due Nov 21th

Required Problems

Divisibility by 11. Let dk dk1 . . . d2 d1 be the decimal expansion of a positive integer with digits dj {0, 1, . . . , 9}, i.e.

dk dk1 . . . d2 d1 = d1 + d2 10 + d3 100 + + dk 10k1 .

Show that 11|dk dk1 . . . d2 d1 if and only if 11 divides the alternating sum of digits d1 d2 + d3 d4 + . . . + (1)k1 dk . Hint: what is 10 (mod 11)? What is 100 = 102 (mod 11), 1000 = 103 (mod 11), etc.? From Problems 4.2 in the text. 1. Prove each of the following assertions (Here a, b Z and m, n, d N): (a) If a b (mod n) and m|n, then a b (mod m). (b) If a b (mod n), then da db (mod dn). (c) If a b (mod n) and d divides a, b, and n, then a/d b/d (mod n/d). 2. Show (by example) that a2 b2 (mod n) need not imply a b (mod n). 3. Show that gcd(a, n) = gcd(b, n) when a b (mod n). 8. (b) Show that for any integer a, we have a3 0, 1, or, 6 (mod 7). 13. Show that if a b (mod m) and a b (mod n), then a b (mod lcm(m, n)). In particular, if m, n are relatively prime, then a b (mod mn). 15. Use induction to show that if a is odd, then for all n 1

a2 1

(mod 2n+2 ).

(This is a special case of the Euler-Fermat theorem, which well prove later.) From Problems 4.4 in the text. 1. Solve the following congruences (i.e. nd all solutions which are distinct modulo the modulus). (a) 25x 15 (mod 29) (b) 5x 2 (mod 26) (c) 6x 15 (mod 21)

8. When eggs in a basket are removed 2, 3, 4, 5, 6, at a time there remain, respectively, 1, 2, 3, 4, 5 eggs. When they are taken out 7 at a time, none are left over. Find the smallest number of eggs that could have been contained in the basket. (Use the Chinese Remainder Theorem Construction.)

Optional Challenge Problems

Problem W. Prove that 5n3 + 7n5 0 (mod 12). Problem X. Let a, dn N with gcd(a, d) = 1. Show m Z such that m a (mod d) and gcd(m, n) = 1.