0
$\begingroup$

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 ?

  • 0
    http://en.wikipedia.org/wiki/Linear_congruence_theorem2013-10-27

2 Answers 2