Maths Olympiad Prep

Library / /32 of 56

Combinatorics Difficulty 5.8 AIME, harder Prove it Singapore

Given 7 distinct positive integers, prove that there is an infinite arithmetic progression of positive integers a,a+d,a+2d,a, a+d, a+2d, \dots, with ada \le d, that contains exactly 3 or 4 of the 7 given integers.

Solution

Let the numbers be X1,X2,,X7X_1, X_2, \dots, X_7 in ascending order. Let [a,d][a, d] denote the arithmetic progression (AP) with initial term aa, common difference dd and ada \le d.

We first show that there is an AP [a,d][a, d] that contains XiX_i, i.e. Xi=a+kidX_i = a + k_i d, i=1,,5i = 1, \dots, 5. For example, we can take a=d=1a = d = 1. Choose such an AP with maximal dd. Then not all kik_i can be even, or else we can use the AP [a,2d][a, 2d], contradicting the choice of dd. Also, not all kik_i can be odd, or else we can use [a+d,2d][a+d, 2d].

We have two cases.

(i) At least 3 of k1,,k5k_1, \dots, k_5 are odd: use [a+d,2d][a+d, 2d].

(ii) At least 3 of k1,,k5k_1, \dots, k_5 are even: use [a,2d][a, 2d].

In either case, we have an AP [a,d][a', d'] that contains exactly 3 or 4 of X1,,X5X_1, \dots, X_5. Note that [a,d][a', d'] is a 'sub-AP' of [a,d][a, d].

Next, we show that there is an AP that contains exactly 3 or 4 of X1,,X6X_1, \dots, X_6. If [a,d][a', d'] contains exactly 3 of X1,,X5X_1, \dots, X_5, or does not contain X6X_6, then it contains exactly 3 or 4 of X1,,X6X_1, \dots, X_6. We are now left with the case where [a,d][a', d'] contains exactly 5 of X1,,X6X_1, \dots, X_6. Then we can apply the above procedure to find a 'sub-AP' [a,d][a'', d''] that contains exactly 3 or 4 of X1,,X6X_1, \dots, X_6.

The same procedure can be used again to find a 'sub-AP' of [a,d][a'', d''] that contains exactly 3 or 4 of X1,,X7X_1, \dots, X_7.

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.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.