Problem

Source: Taiwan 1st TST, final exam, second day, problem 6

Tags: number theory, greatest common divisor, least common multiple, number theory proposed



Find all positive integer triples $(x,y,z)$ such that $x<y<z$, $\gcd (x,y)=6$, $\gcd (y,z)=10$, $\gcd (x,z)=8$, and lcm$(x,y,z)=2400$. Note that the problems of the TST are not arranged in difficulty (Problem 1 of day 1 was probably the most difficult!)