### BCMATH Congruence programs

- Solving the congruence ax ≡ b (mod m)

- The Aubry-Thue theorem

- Solving the congruences x ≡ a (mod m), x ≡ b (mod n)

- Solving the congruences x ≡ a
_{1} (mod m_{1}),..., x ≡ a_{n} (mod m_{n})

- Solving the congruence ax
^{2} + bx +c ≡ 0 (mod n)

- Solving x
^{2} ≡ a (mod n)

- Finding a 2-adic square root of a positive integer of the form 8k+1

- Finding a p-adic square root of a quadratic residue (mod p), p an odd prime

- Shanks baby-steps/giant-steps algorithm for finding the discrete log

- Calculating p-adic log
_{a}(b) (Victor Scharaschkin)

*Last modified 30th October 2024*

Return to main page