Let n be an integer and n>0. Prove that n is the product of a perfect square and (possibly zero) distinct prime numbers.
I know that a perfect square is a number that produces a natural number when taking the square root. So 4, 9, 16, etc. are perfect squares.
So I know that a perfect square can always be represented as m^2 for any integer m.
I just don't know how to get to proving that n must be the product of m^2 and a prime p.