JMO 1999 Problem 2
Let . Prove that for every integer there exists a natural number for which is divisible by but not by .
Dataset text AoPS wiki problems. 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.