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:
“Of all my prosecutors ... not one is my peer, but each and all are my political sovereigns; and had your honor submitted my case to the jury, as was clearly your duty, then I should have had just cause of protest, for not one of those men was my peer; but, native or foreign born, white or black, rich or poor, educated or ignorant, sober or drunk, each and every man of them was my political superior; hence, in no sense, my peer.”
—Susan B. Anthony (1820–1906)
“The forward Youth that would appear
Must now forsake his Muses dear,
Nor in the Shadows sing
His Numbers languishing.”
—Andrew Marvell (1621–1678)