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:
“Oh, that I knew where I might find him, that I might come even to his dwelling! I would lay my case before him, and fill my mouth with arguments. I would learn what he would answer me, and understand what he would say to me. Would he contend with me in the greatness of his power? No; but he would give heed to me. There an upright person could reason with him, and I should be acquitted forever by my judge.”
—Bible: Hebrew, Job 23:3-7.
Job, of God.
“All experience teaches that, whenever there is a great national establishment, employing large numbers of officials, the public must be reconciled to support many incompetent men; for such is the favoritism and nepotism always prevailing in the purlieus of these establishments, that some incompetent persons are always admitted, to the exclusion of many of the worthy.”
—Herman Melville (1819–1891)