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:
“True and false are attributes of speech not of things. And where speech is not, there is neither truth nor falsehood. Error there may be, as when we expect that which shall not be; or suspect what has not been: but in neither case can a man be charged with untruth.”
—Thomas Hobbes (1588–1679)
“Individually, museums are fine institutions, dedicated to the high values of preservation, education and truth; collectively, their growth in numbers points to the imaginative death of this country.”
—Robert Hewison (b. 1943)