Extended Euclidean Algorithm
Find x and y for given a and b such that ax + by = GCD(a, b)
a:
a must an integer
b:
b must an integer
Solve