US-TST 2009 Problem 8
Fix a prime number . Let be integers no two of which have their difference divisible by . Let be nonnegative integers such that is divisible by . Suppose that for all integers , the quantity is divisible by . Prove that each of must be divisible by .
Kiran Kedlaya and Peter Shor.
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.