Symmetry GraphMethod

Problem - 1
Let $n$ be a positive integer, prove that in this series $$\Big\lfloor{\frac{n}{1}}\Big\rfloor, \Big\lfloor{\frac{n}{2}}\Big\rfloor, \Big\lfloor{\frac{n}{3}}\Big\rfloor \cdots \Big\lfloor{\frac{n}{n}}\Big\rfloor$$, there are less than $2\sqrt{n}$ integers distinct.

report an error