Diophantine equation ax+by=c - Script
This JavaScript solves Diophantine equation ax + by = c in integers with the Euclidean algorithm.
It gives also GCD and LCM of a and b and inverse of a modulo b.
x +
y =
Detailed Euclide's algorithm
JavaScript mandatory ! gnn !