Baltic Way 1995 · Problem 5
Number Theory
Let be three positive integers. Prove that among any consecutive positive integers there exist three different numbers such that divides .
When you’re ready
Review material becomes available with the next Daily.
Review
Topics
GCD and LCM · Divisibility and factorization
Solutions
Solution
Solution: First we show that among any consecutive numbers there are two different numbers and such that divides . Among the consecutive numbers there is clearly a number divisible by , and a number divisible by . If , we can take and , and we are done. Now assume that . Then is divisible by , the least common multiple of and . Let . As , we have . Hence there is a number among the consecutive numbers such that is divisible by . Hence is divisible by . But , so we can take and .
Now divide the consecutive numbers into two groups of consecutive numbers. In the first group, by the above reasoning, there exist distinct numbers and such that divides . The second group contains a number divisible by . Then divides .
Contest context
Results from Baltic Way 1995
9 teams
- Mean score
- 2.9 / 5
- Scores of 4 or 5
- 3 / 9
- Estonia
- 3 / 5
Score distribution
All team scores
| Team | Score |
|---|---|
| Poland | 5 / 5 |
| Latvia | 0 / 5 |
| Sweden | 1 / 5 |
| Lithuania | 3 / 5 |
| Denmark | 5 / 5 |
| Finland | 5 / 5 |
| St. Petersburg | 2 / 5 |
| Estonia | 3 / 5 |
| Iceland | 2 / 5 |