Problem

Source: 2019 Saudi Arabia IMO Training Test 3.3

Tags: number theory, GCD, greatest common divisor



Let $d$ be a positive divisor of a positive integer $m$ and $(a_l), (b_l)$ two arithmetic sequences of positive integers. It is given that $gcd(a_i, b_j) = 1$ and $gcd(a_k, b_n) = m$ for some positive integers $i,j,k,$ and $n$. Prove that there exist positive integers $t$ and $s$ such that $gcd(a_t, b_s) = d$.