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:
“In the case of our main stock of well-worn predicates, I submit that the judgment of projectibility has derived from the habitual projection, rather than the habitual projection from the judgment of projectibility. The reason why only the right predicates happen so luckily to have become well entrenched is just that the well entrenched predicates have thereby become the right ones.”
—Nelson Goodman (b. 1906)
“Green grow the rushes-O
What is your one-O?”
—Unknown. Carol of the Numbers (l. 2–3)