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 a deliberate, palpable, and dangerous exercise of ... powers not granted by the compact, the States ... are in duty bound to interpose for arresting the progress of the evil, and for maintaining within their respective limits the authorities, rights, and liberties appertaining to them.”
—James Madison (1751–1836)
“Green grow the rushes-O
What is your one-O?”
—Unknown. Carol of the Numbers (l. 2–3)