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:
“He was then in his fifty-fourth year, when even in the case of poets reason and passion begin to discuss a peace treaty and usually conclude it not very long afterwards.”
—G.C. (Georg Christoph)
“One murder makes a villain, millions a hero. Numbers sanctify, my good fellow.”
—Charlie Chaplin (1889–1977)