# how Euclid's Algorithm can be used to solve linear congruence?

Printable View

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

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