10182

# Extended Euclidean Algorithm

The greatest common divisor of two integers and can be found by the Euclidean algorithm by successive repeated application of the division algorithm. The extended Euclidean algorithm not only computes but also returns the numbers and such that . The remainder of the step in the Euclidean algorithm can be expressed in the form , where and can be determined from the corresponding quotient and the values , or two rows above them using the relations and , respectively. This forward method requires no back substitutions and reduces the amount of computation involved in finding the coefficients and of the linear combination.

### DETAILS

The result saying that the greatest common divisor of any two integers and can be written as their linear combination is also known as the Bachet–Bézout theorem (actually, Bézout formulated it for polynomials).
For more information, see the Wikipedia entry for Extended Euclidean algorithm.
The underlying Mathematica code is an adaptation of the code used in the Demonstration Euclidean Algorithm Steps by Michael Trott.
(The author was supported by project 1ET200300529 of the Information Society of the National Research Program of the Czech Republic and by the Institutional Research Plan AV0Z10300504; the Demonstration was submitted 2008-06-20, revised 2010-03-13.)

### PERMANENT CITATION

Contributed by: Štefan Porubský
Based on a program by: Michael Trott
 Share: Embed Interactive Demonstration New! Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details » Download Demonstration as CDF » Download Author Code »(preview ») Files require Wolfram CDF Player or Mathematica.

#### Related Topics

 RELATED RESOURCES
 The #1 tool for creating Demonstrations and anything technical. Explore anything with the first computational knowledge engine. The web's most extensive mathematics resource. An app for every course—right in the palm of your hand. Read our views on math,science, and technology. The format that makes Demonstrations (and any information) easy to share and interact with. Programs & resources for educators, schools & students. Join the initiative for modernizing math education. Walk through homework problems one step at a time, with hints to help along the way. Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet. Knowledge-based programming for everyone.
 © 2015 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS
 Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX Download or upgrade to Mathematica Player 7EX I already have Mathematica Player or Mathematica 7+