Can I read Extended Euclidean Algorithm Explained on EtoBox?

Extended Euclidean Algorithm Explained by Dang Nhat is a document available to read on EtoBox.

What is Extended Euclidean Algorithm Explained about?

The document summarizes the extended Euclidean algorithm for finding the greatest common divisor (GCD) of two integers. It explains that the algorithm works by repeatedly subtracting or dividing the smaller number from the larger number until finding the GCD. It then describes how the extended Euclidean algorithm can be used to find integers x and y that satisfy the equation ax + by = GCD(a,b), which has many solutions. An example is worked through to find x and y for the equation 1914x + 899y = 29. Finally

Author

Dang Nhat

Language

EN