I want to solve $ax \equiv b \mod n$ given a solution $x_0$. How can i prove that there are exactly $(a,n)$ solutions ?
Number of solutions of $ax \equiv b \mod n$
0
$\begingroup$
elementary-number-theory
modular-arithmetic
-
0http://en.wikipedia.org/wiki/Linear_congruence_theorem – 2013-10-27