Let $\displaystyle n \ge 2$ be a number that is not a prime.

Show that there is a divisor $\displaystyle p$ of $\displaystyle n$, with $\displaystyle p \ge 2$, so that $\displaystyle n \ge p^2$

On my paper, I've written down n=rs where n and s are any natural numbers >1. Not sure if that's needed, though.