MathDB
B 3

Source:

May 25, 2007
modular arithmeticPrimitive Rootspen

Problem Statement

Show that for each odd prime pp, there is an integer gg such that 1<g<p1<g<p and gg is a primitive root modulo pnp^n for every positive integer nn.
Back to ProblemsView on AoPS