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:
“If you think dope is for kicks and for thrills, you’re out of your mind. There are more kicks to be had in a good case of paralytic polio or by living in an iron lung. If you think you need stuff to play music or sing, you’re crazy. It can fix you so you can’t play nothing or sing nothing.”
—Billie Holiday (1915–1959)
“One murder makes a villain, millions a hero. Numbers sanctify, my good fellow.”
—Charlie Chaplin (1889–1977)