Bezout | npm.io

Compute the gcd and solve Bezout's identity using the extended Euclidean algorithm.

gcd extgcd extended gcd modular inverse math maths mathematics euclid

1.0.0 • Published 6 years ago

Solve Diophantine Equations and Diophantine Approximations.

math diophantine equations linear-equations equation-solver linear-algebra algebra symbolic planes surfaces

1.1.2 • Published 2 years ago