(New page: Category:MA453Spring2009Walther If gcd(a,m)=1, then ax=b(mod m) has exactly one solution) |
(No difference)
|
Latest revision as of 13:54, 5 February 2009
If gcd(a,m)=1, then ax=b(mod m) has exactly one solution
(New page: Category:MA453Spring2009Walther If gcd(a,m)=1, then ax=b(mod m) has exactly one solution) |
(No difference)
|
If gcd(a,m)=1, then ax=b(mod m) has exactly one solution
