1999 USAMO Problems/Problem 3
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 .)
This problem needs a solution. If you have a solution for it, please help us out by.
|1999 USAMO (Problems • Resources)|
|1 • 2 • 3 • 4 • 5 • 6|
|All USAMO Problems and Solutions|