The problem reads as follows: Let n be a positive integer that is not a perfect square. Prove that √n is irrational. I understand the basic outline that a proof would have. Assume √n is rational and use a proof by contradiction. We can set √n=p/q where p and q are integers with gcd(p,q)=1. Now n=p2/q2. Next, nq2=p2. This implies p2 is divisible by q2, which subsequently implies that p is divisible by q. If n was a perfect square, its root would be an integer so q=1 and this is satisfied. However, if n is not a perfect square, its root would not be an integer. Thus, p divisible by q shows that gcd(p,q)≠1 and we have a contradiction. My confusion is with the following step: p2 is divisible by q2 implies that p is divisible by q. Thank you so much for all of the help you can give me.