Question 37
Find all sequences $x_1, x_2, \dots, x_{50}$ of 50 positive integers, with greatest common divisor equal to 1, such that, for every pair of distinct indices $i, j$, the least common multiple of $x_i$ and $x_j$ divides the sum of the squares of the remaining 48 terms.