## 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 \ )$