Algoteka

Extended Euclidean Algorithm - All languages

Problem by oml1111

Problem description:

Implement the Extended Euclidean Algorithm. Use it to find \(x\) and \(y\) satisfying the equation \(ax + by = \text{gcd}(a, b)\) for some values of \(a\) and \(b\).

Extended Euclidean algorithm - wikipedia.org

Verified languages:

# Language Count
1 C++ 1

Unverified languages:

# Language Count
No unverified languages ...
View problem discussion (0 comments)