The converse to Fermat's little theorem
Statement
Let be a positive integer such that
for every integer . The converse to Fermat's little theorem. Then must be a prime number. This statement is the converse formulation of Fermat's little theorem; it is solved, having been proved by Alford, Granville, and Pomerance in 1994.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.