KöMaL 2008 A462
Let be an odd prime and let 1<< be an integer. Prove that divides if and only if there exists an odd positive integer for which is congruent to 1 modulo .
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.