MathNet 2015-part-01 — 191 problems (EN–VI) Question 136

Let $n$ be a positive integer. If, for every prime divisor $p$ of $n$, the number $p^{2}$ does not divide $n$, we say that $n$ is square-free. Show that every square-free number has a number of divisors equal to a power of 2.