Math 246F 2015: Homework 2

Due at the beginning of tutorial on week 4

Wed, Oct 7, Thr Oct 8

Please turn in only problems 2, 4, 7, 8b, 12, and 13. The rest
of the problems are suggested for practice.

(1) Prove by induction that any natural number is either even or odd.
(2) Let r 6= 1 be a real number. Prove by induction that for all natural
numbers n,
1 + r + r2 + + rn =

1 rn+1
.
1r

(3) Fix a natural number n. Prove that (1 + n)3m 1 is divisible by n

for every m N.
(4) Show that there is no natural number k such that 2k 1 (mod 6).
Hint: Find all possible values of 2k (mod 6).
(5) Let p and q be distinct primes. Suppose a, b are integers satisfying
a b ( mod p ) and a b ( mod q ). Show that a b ( mod pq ).
(6) Let p and q be distinct primes and a a natural number relatively
prime to pq. Prove that a(p1)(q1) 1 ( mod pq ). Hint: you can
use Fermats Little Theorem and exercise number (5) above.
101
(7) Find 105
( mod 21 ).
(8) For each of the following, find the remainder when a is divided by
m:
(a) a = 6229 4 ; m = 5.
(b) a = 207321 + 689! ; m = 7.
(c) a = 873645768765 ; m = 9.
(d) a = (123)(45)(678)(910)(112) ; m = 6.
(9) Textbook section 4.2 problem 2a.
(10) Textbook section 4.2 problems 4.
(11) Textbook section 4.2 problems 9.
(12) Textbook section 4.2 problem 11a (You can assume you know the
result of problem 10). Hint: Fermats theorem 5.1.2.
(13) Textbook section 5.3 problem 4.
(14) Textbook section 5.3 problem 12.