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)
“Captain Quinlan: When this case is over, I’ll come around some night and sample some of your chili.
Tanya: Better be careful. May be too hot for you.”
—Orson Welles (1915–1985)
“And when all bodies meet
In Lethe to be drowned,
Then only numbers sweet
With endless life are crowned.”
—Robert Herrick (1591–1674)