This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Exercise 3. 2.8.22: Let p be prime and let g be a primitive root mod p . Show that ( p1)! ≡ g · g 2 ··· g p1 mod p and give another proof of Wilson’s congruence (Theorem 2.11). Exercise 4. 2.8.35: Let p be prime. Show that there are inﬁnitely many primes congruent 1 mod p . Exercise 5. 2.8.37: Assume n > 1. Show that n does not divide 2 n1. Exercise 6. 2.8.22: Let p be prime and let g be a primitive root mod p . Show that ( p1)! ≡ g · g 2 ··· g p1 mod p and give another proof of Wilson’s congruence (Theorem 2.11)....
View
Full
Document
This note was uploaded on 04/05/2010 for the course CS 150 taught by Professor Humphreys,g during the Spring '08 term at UVA.
 Spring '08
 Humphreys,G

Click to edit the document details