TR-MO 1995 Problem 1
Let be integers with and for all . Show that for any integers there are infinitely many integers which do not satisfy any of the congruences
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.