1975 IMO Problems/Problem 2
Let be an infinite increasing sequence of positive integers. Prove that for every there are infinitely many which can be written in the formwith positive integers and .
If we can find such that , we're done: every sufficiently large positive integer can be written in the form . We can thus assume there are no two such . We now prove the assertion by induction on the first term of the sequence, . The base step is basically proven, since if we can take and any we want. There must be a prime divisor which divides infinitely many terms of the sequence, which form some subsequence . Now apply the induction hypothesis to the sequence .
The above solution was posted and copyrighted by grobber. The original thread for this problem can be found here: 
|1975 IMO (Problems) • Resources|
|1 • 2 • 3 • 4 • 5 • 6||Followed by|
|All IMO Problems and Solutions|