I've come across the statement that if gcd and m\mid x and n\mid x, then mn\mid x. (This is needed for a proof of the correctness of RSA that I have been given.)
I can't see how to prove that is the case. Can anyone either show me how, or give me a clue?
(NB: gcd = greatest common divisor = highest common factor = hcf)
No comments:
Post a Comment