Extended Euclidean Algorithm - The Case of More Than Two Numbers

The Case of More Than Two Numbers

One can handle the case of more than two numbers iteratively. First we show that . To prove this let . By definition of gcd is a divisor of and . Thus for some . Similarly is a divisor of so for some . Let . By our construction of, but since is the greatest divisor is a unit. And since the result is proven.

So if then there are and such that so the final equation will be

So then to apply to n numbers we use induction

with the equations following directly.

Read more about this topic:  Extended Euclidean Algorithm

Famous quotes containing the words case and/or numbers:

    The bond between a man and his profession is similar to that which ties him to his country; it is just as complex, often ambivalent, and in general it is understood completely only when it is broken: by exile or emigration in the case of one’s country, by retirement in the case of a trade or profession.
    Primo Levi (1919–1987)

    Our religion vulgarly stands on numbers of believers. Whenever the appeal is made—no matter how indirectly—to numbers, proclamation is then and there made, that religion is not. He that finds God a sweet, enveloping presence, who shall dare to come in?
    Ralph Waldo Emerson (1803–1882)