Solving a linear congruence
We solve the congruence ax
b (mod m), where m > 0.
(See
MP313 notes
.)
Enter a:
Enter b:
Enter m (> 0):
Last modified 31st August 2002
Return to main page
b (mod m), where m > 0.