Solving a Linear Diophantine Equation in Two Variables by the Euclidean Algorithm
Solving a Linear Diophantine Equation in Two Variables by the Euclidean Algorithm
This Demonstration shows the solutions of Diophantine equations of the form , and using the Euclidean algorithm.
ax+by=gcd(a,b)
ax+by=0
ax+by=c