Problem

Source: 2019 Saudi Arabia IMO Training Test 2.1

Tags: number theory, remainder



Let be given a positive integer $n \ge 3$. Consider integers $a_1,a_2,...,a_n >1$ with the product equals to $A$ such that: for each $k \in \{1, 2,..., n\}$ then the remainder when $\frac{A}{a_k}$ divided by $a_k$ are all equal to $r$. Prove that $r \le n- 2$