MathDB
Miklós Schweitzer 1957- Problem 8

Source:

October 18, 2015
number theorycollege contests

Problem Statement

8. Find all integers a>1a>1 for which the least (integer) solution nn of the congruence an1(modp)a^{n} \equiv 1 \pmod{p} differs from 6 (p is any prime number). (N. 9)