Friday, 14 April 2017

elementary number theory - Prove that if gcd(m,n)=1 and mmidx and nmidx, then mnmidx.

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

real analysis - How to find lim_{hrightarrow 0}frac{sin(ha)}{h}

How to find \lim_{h\rightarrow 0}\frac{\sin(ha)}{h} without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...