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 the case, case and/or numbers:
“To be President of the United States, sir, is to act as advocate for a blind, venomous, and ungrateful client; still, one must make the best of the case, for the purposes of Providence.”
—John Updike (b. 1932)
“Consumer wants can have bizarre, frivolous, or even immoral origins, and an admirable case can still be made for a society that seeks to satisfy them. But the case cannot stand if it is the process of satisfying wants that creates the wants.”
—John Kenneth Galbraith (b. 1908)
“Old age equalizes—we are aware that what is happening to us has happened to untold numbers from the beginning of time. When we are young we act as if we were the first young people in the world.”
—Eric Hoffer (1902–1983)