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:
“Consider the deference which is everywhere paid to a doctor’s opinion. Nothing more strikingly betrays the credulity of mankind than medicine. Quackery is a thing universal, and universally successful. In this case it becomes literally true that no imposition is too great for the credulity of men.”
—Henry David Thoreau (1817–1862)
“I’m not even thinking straight any more. Numbers buzz in my head like wasps.”
—Kurt Neumann (1906–1958)