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:
“There is not a more disgusting spectacle under the sun than our subserviency to British criticism. It is disgusting, first, because it is truckling, servile, pusillanimous—secondly, because of its gross irrationality. We know the British to bear us little but ill will—we know that, in no case do they utter unbiased opinions of American books ... we know all this, and yet, day after day, submit our necks to the degrading yoke of the crudest opinion that emanates from the fatherland.”
—Edgar Allan Poe (1809–1845)
“And when all bodies meet
In Lethe to be drowned,
Then only numbers sweet
With endless life are crowned.”
—Robert Herrick (1591–1674)