MathDB
B 1

Source:

May 25, 2007
quadraticsmodular arithmeticPrimitive Roots

Problem Statement

Let nn be a positive integer. Show that there are infinitely many primes pp such that the smallest positive primitive root of pp is greater than nn.
Back to ProblemsView on AoPS