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 ≡ a1 (mod m1),..., x ≡ an (mod mn);
- Solving the congruence ax2 + bx +c ≡ 0 (mod n);
- Solving x2 ≡ 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.
- Calculating p-adic loga(b) (Victor Scharaschkin)
Last modified 19th March 2021
Return to main page