BCMATH Congruence programs

1. Solving the congruence ax ≡ b (mod m)

2. The Aubry-Thue theorem

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

4. Solving the congruences x ≡ a₁ (mod m₁),..., x ≡ a_n (mod m_n)

5. Solving the congruence ax² + bx +c ≡ 0 (mod n)

6. Solving x² ≡ a (mod n)

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

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

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

10. Calculating p-adic log_a(b) (Victor Scharaschkin)

Last modified 30th October 2024
Return to main page