CMO 1972 Problem 3
- Paper
a) Prove that is composite in all bases greater than 2.
b) Prove that is composite in all bases.
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.