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:
“Massachusetts sat waiting Mr. Loring’s decision.... It was really the trial of Massachusetts. Every moment that she hesitated to set this man free, every moment that she now hesitates to atone for her crime, she is convicted. The commissioner on her case is God; not Edward G. God, but simply God.”
—Henry David Thoreau (1817–1862)
“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)