PEN

PEN B 2007

1 Let n be a positive integer. Show that there are innitely many primes p such that the smallest positive primitive root of p is greater than n. 2 Let p be a prime with p > 4
2 p1 22k , where k denotes the number of distinct prime (p 1) divisors of p 1, and let M be an integer. Prove that the set of integers {M + 1, M + p 1 k 2 p 1} contains a primitive root modulo p. 2, , M + 2 (p 1)

3 Show that for each odd prime p, there is an integer g such that 1 < g < p and g is a primitive root modulo pn for every positive integer n. 4 Let g be a Fibonacci primitive root (mod p). i.e. g is a primitive root (mod p) satisfying g 2 g + 1 (mod p). Prove that g 1 is also a primitive root (mod p). if p = 4k + 3 then (g 1)2k+3 g 2 (mod p), and deduce that g 2 is also a primitive root (mod p). 5 Let p be an odd prime. If g1 , , g(p1) are the primitive roots (mod p) in the range 1 < g p 1, prove that
(p1)

gi (p 1)
i=1

(mod p).

6 Suppose that m does not have a primitive root. Show that a for every a relatively prime m. 7 Suppose that p > 3 is prime. Prove that the products of the primitive roots of p between 1 and p 1 is congruent to 1 modulo p. 8 Let p be a prime. Let g be a primitive root of modulo p. Prove that there is no k such that g k+2 g k+1 + 1 g k + 2 (mod p).
(m) 2

(mod m)

This le was downloaded from the AoPS MathLinks Math Olympiad Resources Page http://www.artofproblemsolving.com/ Page 1 http://www.mathlinks.ro/