![Solving a Linear Diophantine Equation in Two Variables by the Euclidean Algorithm - Wolfram Demonstrations Project Solving a Linear Diophantine Equation in Two Variables by the Euclidean Algorithm - Wolfram Demonstrations Project](https://demonstrations.wolfram.com/SolvingALinearDiophantineEquationInTwoVariablesByTheEuclidea/img/popup_1.png)
Solving a Linear Diophantine Equation in Two Variables by the Euclidean Algorithm - Wolfram Demonstrations Project
GitHub - MManoah/euclidean-and-extended-algorithm-calculator: Finds the GCD using the euclidean algorithm or finds a linear combination of the GCD using the extended euclidean algorithm with all steps/work done shown
GitHub - Lavertis/extended-euclidean-calculator: A static website using pure JavaScript for extended euclidean algorithm calculation.
![Hardware Implementation of Greatest Common Divisor using subtractor in Euclid Algorithm | Semantic Scholar Hardware Implementation of Greatest Common Divisor using subtractor in Euclid Algorithm | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/471202d272017feca21a3dcfb145199386977537/4-Figure5-1.png)