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 the case, case and/or numbers:
“To be President of the United States, sir, is to act as advocate for a blind, venomous, and ungrateful client; still, one must make the best of the case, for the purposes of Providence.”
—John Updike (b. 1932)
“[The boss] asked me if I was not interested in a change in my life. I answered that one can never change lives, that in any case all lives were the same, and that I was not at all unhappy with mine.”
—Albert Camus (1913–1960)
“Out of the darkness where Philomela sat,
Her fairy numbers issued. What then ailed me?
My ears are called capacious but they failed me,
Her classics registered a little flat!
I rose, and venomously spat.”
—John Crowe Ransom (1888–1974)