Solving a Single Congruence Equation

[Thomas Klemm]

This program for the HP-42S solves for x in the equation:

A * x = B mod N

Example:
5 * x = 3 mod 17

Solution:
5 ENTER 3 ENTER 17
XEQ "CONG"
4



Remark:
Since overflow is avoided it's possible to solve:
999,999,999,989 * x = 1 mod 999,999,999,999

Solution:
899,999,999,999