For any integers a, b (not both zero), there exist integers x, y such that ax + by = gcd(a, b). The pair (x, y) is not unique; the extended Euclidean algorithm computes one concretely and parameterises all solutions as (x + kb/d, y −…
For any integers a, b (not both zero), there exist integers x, y such that ax + by = gcd(a, b). The pair (x, y) is not unique; the extended Euclidean algorithm computes one concretely and parameterises all solutions as (x + kb/d, y −…