USAMO 1999 Problem 3
- Day 1
Let be a prime and let be integers not divisible by , such that for any integer not divisible by . Prove that at least two of the numbers , , , , , are divisible by . (Note: denotes the fractional part of .)
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.