ch is equivalent to the <a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm" target="_blank">extended Euclidean algorithm</a>. After &mu; is solved, m is obtained by multiplying &mu; by <span class="nowrap">S<sub>1</sub></span>. Note that m is not unique. Adding m to any multiples of a is also a solution. Let M be the smallest positive solution. Then the general solution is <span class="nowrap">m=M+ka</span>, where k is any integer. The number <span class="nowrap">N<sub>0</sub>=R<sub>0</sub>