This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 2 n + 1, with n 1. Note that p 1 mod 4. With this assumption, show that 7 ( p1) / 2 1 mod p 3. a) ( 2 pts ) Let p be an odd prime, with p 6 = 5. Show that 5 p = 1 p p 5 b) ( 4 pts ) Hence nd the congruence condition on an odd prime p 6 = 5, for which x 2 5 mod p is solvable. 4. ( 2 pts ) Determine whether x 2 35 mod 1003 is solvable (given that 1003 is a prime). 1...
View Full
Document
 Fall '07
 MOK
 Number Theory, Congruence

Click to edit the document details