This preview shows page 1. Sign up to view the full content.
Unformatted text preview: person who knows no one], 40, Ch. 5 Suppl. Ex. 18. 5.3: 22(a, c, f), 24, 26, 38 5.4: 8, 14, 22, 24 (A) Using the binomial theorem and result of 5.4, Ex. 24, prove by induction on n that n p n (mod p ) for every positive integer n , where p is prime. Then use this result to give a proof of Fermats little theorem....
View Full Document
- Fall '08