Euclidean Algorithm 1.0

Function1
　You can find a solution G.C.D.(greatest common divisor) by Euclidean Algorithm.
In a story of cutting a cake into same-size, you may understand that (a/b)=r → gcd(a,b)=gcd(b,r).


Function2
　You can solve indeterminate equation of the first degree and determine particular solution by Extended Euclidean Algorithm.This function shows all the intermediate expression.It may be useful not to study Euclidean Algorithm but rather to calculate indeterminate equation instead of you.