Revision as of 12:54, 5 February 2009 by Norris (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


If gcd(a,m)=1, then ax=b(mod m) has exactly one solution

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood