lidean algorithm and then multiply the result by <span class="nowrap">S<sub>3</sub></span>. We then add an appropriate multiple of u to obtain the smallest positive solution K. The final solution is <span class="nowrap">N=R<sub>0</sub>+60(M+Ka)</span>. However, there is another stupulation: if N is greater than 100 million years, the solution is rejected. In that case, we need to choose another set of parameters A, U, T, <span class="nowrap">R<sub>1</sub></span> and <span class="nowrap">R<sub>2</sub></span>