1999 USAMO Problems/Problem 3
Problem
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 .)
Solution
We see that means that . Now, since does not divide and is prime, their GCD is 1 so .
Since , then we see that they have to represent mods , and thus, our possible values of are all such that for all . This happens when or .
When then is not divisible by 3, thus two are , and the other two are . Thus, four pairwise sums sum to 3.
When then is not divisible by 5 so are and , so two pairwise sums sum to 5.
All three possible cases work so we are done.
(This solution makes absolutely no sense. Why does ??)
See Also
1999 USAMO (Problems • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAMO Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.