MathNet 2004 — Part 01 Question 115

Find all sets $X$ consisting of at least two positive integers such that for every pair $m, n \in X$, where $n\gt m$, there exists $k \in X$ such that $n = m k^{2}$.