BG-MO 2001 Problem 3
Let be a prime number congruent to modulo , and consider the equation . Prove that this equation has infinitely many solutions in positive integers, and show that if is a solution of the equation in positive integers, then .
Dataset text AI-MO AoPS. 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.