Maths Olympiad Prep

Library / /63 of 91

, 2006

Number theory Difficulty 6.7 National Olympiad Prove it India

Let A1,A2,,AnA_1, A_2, \dots, A_n be arithmetic progressions of integers, each of kk terms, such that any two of these arithmetic progressions have at least two common elements. Suppose bb of these arithmetic progressions have common difference d1d_1 and the remaining arithmetic progressions have common difference d2d_2, where 0<b<n0 < b < n. Prove that
b2(kd2gcd(d1,d2))1. b \le 2 \left( k - \frac{d_2}{\text{gcd}(d_1, d_2)} \right) - 1.

Solution

Let [d1,d2][d_1, d_2] denote the least common multiple of d1d_1 and d2d_2. Let PjP_j denote the union of all arithmetic progressions with common difference djd_j, j=1,2j = 1, 2, and let S=P1P2S = P_1 \cap P_2. Then SS is an arithmetic progression with common difference [d1,d2][d_1, d_2]. Let yy be the least element of P1P_1 and xx the least element of SS.
Since any two arithmetic progressions with common difference d1d_1 have at least two common elements bk1b \le k-1. If d2gcd(d1,d2)k2\frac{d_2}{\text{gcd}(d_1, d_2)} \le \frac{k}{2}, then the result follows from bk1b \le k-1. Suppose d2gcd(d1,d2)>k2\frac{d_2}{\text{gcd}(d_1, d_2)} > \frac{k}{2}. Let
m0=2d2gcd(d1,d2)k. m_0 = 2 \frac{d_2}{\text{gcd}(d_1, d_2)} - k.
Each arithmetic progression with common difference d1d_1 contains at least 2 elements of SS and starts at one of the points y+md1y+md_1, 0mk20 \le m \le k-2. However an arithmetic progression with common difference d1d_1 starting at one of the points x+d1,x+2d1,,x+m0d1x+d_1, x+2d_1, \dots, x+m_0d_1 contains only one point of SS namely x+[d1,d2]x+[d_1, d_2]. Hence
bk1m0=2(kd2gcd(d1,d2))1. b \le k-1 - m_0 = 2 \left( k - \frac{d_2}{\text{gcd}(d_1, d_2)} \right) - 1.

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.