Problem 4. Let p be an odd prime, and let Tp C Zp denote the set of elements of Zp which are perf...
(1) Let p be a prime number. The following polynomials are considered as elements in Zp[ (a) Show that zP-1-(z -1)( 2) ( (p 1)) (b) Let φο : Zp[2] Zp be the evaluation homomorphism at 0. Compute φο(zp-1-1) and φο((1-1)(1-2) . . . (z-(p-1))) (c) Use parts (a) and (b) to conclude that (-1)--1. (1) Let p be a prime number. The following polynomials are considered as elements in Zp[ (a) Show that zP-1-(z -1)( 2) ( (p 1))...
2. Let p be an odd prime. We saw last week that the problem of counting solutions to the congruence (mod p) is only interesting when p has the form 4k1. For the rest of this problem let p 4k+1. (a) Show that (mod -1 5 (mod 8) (b) Show that pEl (mod 8 -1 p5 (mod 8) (c) Draw condlusions about the number of solutions to these congruences 14 (mod p) -1 (mod p) (mod p) 2. Let p...
5a. Show that in Zp, p prime, the only elements that are self-inverses (ie. elements [a] such that [a]. [a] = [1]) are [1] and [p 1 b. In Zp, p prime, show that [p-1)!] [-1]. This result is known as Wilson's Theorem. c. Show that if n is a positive integer greater than 1 and [(n-1)!] = [-1] in Zn, then n is prime. This is the converse of Wilson's Theorem.
10. Let [n] be an element in Zp, p prime. We say [n] is perfect provided [o (n)] [2n]. Show that d-[21,where Idy]-'is the multiplicative inverse of ld in Z, [dkl In 10. Let [n] be an element in Zp, p prime. We say [n] is perfect provided [o (n)] [2n]. Show that d-[21,where Idy]-'is the multiplicative inverse of ld in Z, [dkl In
Let p be an odd prime. Write p in the form p = 2k + 1 for some k E N. Prove that kl-(-1)* mod p. Hint: Each j e Z satisfies j (p-od p.
8. Let g be a primitive root of an odd prime p, and suppose that p3 (mod 4). Show that -g is not a primitive root of p. 8. Let g be a primitive root of an odd prime p, and suppose that p3 (mod 4). Show that -g is not a primitive root of p.
Let p be a prime. Show that Zp(X)/(X2+1) is a field iff the equation x2=-1 has no solution (mod p).
76.Let p be an odd prime. Prove that if Ord, (a) = his even, then a/2 = -1 mod p. 77.let p be an odd prime. Prove that if Ord, (a) = 3, then 1+ a + a? = 0 mod p and Ord,(1 + a) = 6. 78.Show that 3 is a primitive root modulo 17. How many primitive roots does 17 have? Find them.
8. Let p be a prime number. Define -c0t}cQ ZAp) Prove that Zp) is a subring of Q Prove that Z is a subring of Z Show that the field of fractions of Zp) is isomorphic to Q
please prove proofs and do 7.4 7.2 Theorem. Let p be a prime, and let b and e be integers. Then there exists a linear change of variahle, yx+ with a an integer truns- farming the congruence xbx e0 (mod p) into a congruence of the farm y (mod p) for some integer 8 Our goal is to understand which integers are perfect squares of other inte- gers modulo a prime p. The first theorem below tells us that half...