Can we conclude that $n = m^2$ for some $m \in \mathbb N$?

59 Views Asked by At

Let $n \in \mathbb N$ be such that for every prime $p$, the following holds: $$p \mid n \implies p^2 \mid n$$ Can we conclude that $n = m^2$ for some $m \in \mathbb N$?

How can I prove or disprove this, I'm not sure where to begin. Thanks.

1

There are 1 best solutions below

0
On

Hint: Try $n=8$. $\ \ \ \ \ \ \ \ \ $