 and start over. The procedure may need to be repeated a few times until an acceptable N is obtained.</p><p>By tackling one equation at a time, the amount of computation involved in the <i>y&#462;nj&#236;</i> algorithm is much less than the Chinese remainder theorem, which involves the multiplication of large numbers. Since the numbers T, U, and A tend to be large, the amount of computation saved is tremendous.</p><p>When an acceptable value of N is obtained, the next step is to adjust the other astronomica