This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 6 . Find the number of primitive roots mod p 2 when p is the prime 257. 7 . Express the continued fraction h 6 , 6 , 6 , . . . i in the form a + b d , with a and b rational numbers and d a positive non-square integer. 8 . Suppose that p = a 2 + b 2 , where p is an odd prime number and a is odd. Show that a p = +1. (Use the Jacobi symbol.) 9 . Let n be an integer. Show that n is a dierence of two squares (i.e., n = x 2-y 2 for some x, y Z ) if and only if n is either odd or divisible by 4. 10 . Let n be an integer greater than 1. Prove that 2 n is not congruent to 1 mod n ....
View Full Document
This note was uploaded on 10/31/2009 for the course STAT 131A taught by Professor Isber during the Spring '08 term at University of California, Berkeley.
- Spring '08