Problem:
Let be a positive integer. Prove that there exist integers and , neither of which is divisible by , such that .
Solution
Solution:
For the first several values of it is straightforward to find solutions and satisfying , leading to this table of solutions.
| 1 | 1 | 1 |
| 2 | 1 | 2 |
| 3 | 5 | 1 |
| 4 | 7 | 4 |
| 5 | 1 | 11 |
The key is to realize that negating any value of or also yields a solution, so we may recast the table as follows.
| 1 | -1 | -1 |
| 2 | 1 | -2 |
| 3 | 5 | -1 |
| 4 | 7 | 4 |
| 5 | -1 | 11 |
It is now apparent that we should take and . One then confirms that
from which it easily follows by induction that for all . Finally, one can also show by induction that , hence none of the or are divisible by .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.