Solving the congruence ax2 + bx + c ≡ 0 (mod n), a, n ≥ 1

See note.

flag = 1 gives verbose output, whereas flag = 0 is non-verbose.

Enter a (≥ 1):
Enter b:
Enter c:
Enter n (≥ 1):
Enter flag (0 or 1):

Last modified 19th March 2021
Return to main page