Let $n \ge 2$ be an integer and $p_1 < p_2 < ... < p_n$ prime numbers. Prove that there exists an integer $k$ relatively prime with $p_1p_2... p_n$ and such that $gcd (k + p_1p_2...p_i, p_1p_2...p_n) = 1$ for all $i = 1, 2,..., n - 1$. Malik Talbi
Source: 2015 Saudi Arabia BMO TST I p4
Tags: number theory, primes, coprime, GCD
Let $n \ge 2$ be an integer and $p_1 < p_2 < ... < p_n$ prime numbers. Prove that there exists an integer $k$ relatively prime with $p_1p_2... p_n$ and such that $gcd (k + p_1p_2...p_i, p_1p_2...p_n) = 1$ for all $i = 1, 2,..., n - 1$. Malik Talbi