Hi,(adsbygoogle = window.adsbygoogle || []).push({});

I need help with this problem.

Show that ifaandmare relatively prime positive integers, then the inverse of a modulo m is unique modulo m.

[hint: assume that there are 2 solutions b and c of the congruenceax==1(mod m).No need to prove thatb==c (mod m)]

I have just started:

a*b==1(mod m) and c*a==1(mod m)-->a*b==c*a(mod m)

-->b==c (mod m)

then ??

Can I have some help please?

B

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Inverse modulo

**Physics Forums | Science Articles, Homework Help, Discussion**