I can't get my head around a proof for the following
problem.
If a,b and c are positive integers and p is prime and
hcf{a2p,b}=p2, then
hcf{a2,b}=p2.
Any ideas on where to go with it would be appreciated.
p2 divides a2p, so p
divides a2. Hence p divides a, so p2 divides
a2. Also we know p2 divides b. Hence
p2 divides a2 and b. And any larger common
factor of these two also divides a2p, b, contradicting
the hypothesis, so p2 is the highest common
factor.
David
Thanks David, I just couldn't get started on it and the annoying
thing is I knew I knew it. Know what I mean?
Thanks again for saving my sanity!!! LOL