SMO 2000 Problem 2
Show that divides all numbers of the form , where p and q are prime numbers strictly greater than . Show also that is the greatest common divisor of all numbers of the form , with and prime numbers strictly greater than .
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.