Prove that the highest common factor of
and = 1, where for some prime p and natural number m.
If the hcf you mentioned is the same as greatest common divisor (I don't what's the difference between them, if there is!!) then you can notice that any factor of q is power of p then p divide the hcf if it isn't equal to 1. Therefore
which implies, for some (property of prime elements) which is impossible. So the hcf is 1.