Thursday, 7 August 2014

elementary number theory - Modulus Cancellation Law

I'm trying to understand the proof for cancellation law in modulus which states that:



    ak = bk mod m


<=> m | (a-b)k
since (k,m) = 1
<=> m | (a-b)

<=> a = b mod m


However, I don't understand why:





if gcd(k,m)=1, then m(ab)km(ab)$




Can anybody help me please? :)

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

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