Prove that every integer n > 1 is the product of a square-free integer and a perfect square.
proof.
Should I start by saying n = a product of primes by the fundamental theorem? But I can't seem to get anywhere after that.
Because I am trying to show you an example. I am saying suppose that has that specific type of factorization, then we can do what I did above. Those were just examples. There is a general rule that we use, that rule is what you have to find and apply it to the general case.