Describe how Euclid's Algorithm can be used to find all the solutions in :

$\displaystyle ax\equiv b \ \ ( mod \ m \ ) $

- Apr 13th 2009, 05:53 PMsilversandhow Euclid's Algorithm can be used to solve linear congruence?
Describe how Euclid's Algorithm can be used to find all the solutions in :

$\displaystyle ax\equiv b \ \ ( mod \ m \ ) $