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
![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_3.png)
Solving a Linear Diophantine Equation in Two Variables by the Euclidean Algorithm - Wolfram Demonstrations Project
![University Discrete Mathematical Structures] How to calculate the last step in an Extended Euclidean Algorithm example. : r/HomeworkHelp University Discrete Mathematical Structures] How to calculate the last step in an Extended Euclidean Algorithm example. : r/HomeworkHelp](https://preview.redd.it/89la6ngpx6u51.png?width=637&format=png&auto=webp&s=69ce6e371970ded844ec77488b9958d191fdec48)