Let $a_1, a_2, \ldots, a_n$ ($n\ge 3$) be positive integers such that $gcd(a_1, a_2, \ldots, a_n)=1$ and for each $i\in \lbrace 1,2,\ldots, n \rbrace$ we have $a_i|a_1+a_2+\ldots+a_n$. Prove that $a_1a_2\ldots a_n | (a_1+a_2+\ldots+a_n)^{n-2}$.
Source: 2019 Second Round - Poland
Tags: number theory, positive integers, Divisibility
Let $a_1, a_2, \ldots, a_n$ ($n\ge 3$) be positive integers such that $gcd(a_1, a_2, \ldots, a_n)=1$ and for each $i\in \lbrace 1,2,\ldots, n \rbrace$ we have $a_i|a_1+a_2+\ldots+a_n$. Prove that $a_1a_2\ldots a_n | (a_1+a_2+\ldots+a_n)^{n-2}$.