Recent content by maphec

Hi, did you ever get a solution or an approach to this problem? I am also working on the same one right now and am stuck on it...

Proof: Supposed n is prime and that n|ab therefore, n|a or n|b, but not both Case 1: n|a and n does not divide b therefore n|a^2 since n does not divide b, n does not divide b^2 Case 2: n|b and n does not divide a therefore n|b^2 since n does not divide a, n does not divide a^2...

(a,b)=d means d is the GCD of a and b Question: Let (a,b)=1 Prove: (a^2,b^2)=1 The hint that we were given is to prove this by contradiction ... but, I have no idea how to go about even starting this proof ... Any and all help would be greatly appreciated!