US-TST 2000 Problem 3
Let be a prime number. For integers such that is not divisible by , let denote the number of integers such that and are either both less than or both greater than . Prove that there exists such that for and all ,
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.