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:
“Chile consents to do all we can reasonably demand. My regret is that our Government blustered and bullied. President [Benjamin] Harrison argued in his message like a prosecutor—made the most of the case against our weak sister. Forbearance, charity, friendship, arbitration should have been in our words and thoughts.”
—Rutherford Birchard Hayes (1822–1893)
“A more problematic example is the parallel between the increasingly abstract and insubstantial picture of the physical universe which modern physics has given us and the popularity of abstract and non-representational forms of art and poetry. In each case the representation of reality is increasingly removed from the picture which is immediately presented to us by our senses.”
—Harvey Brooks (b. 1915)
“What culture lacks is the taste for anonymous, innumerable germination. Culture is smitten with counting and measuring; it feels out of place and uncomfortable with the innumerable; its efforts tend, on the contrary, to limit the numbers in all domains; it tries to count on its fingers.”
—Jean Dubuffet (1901–1985)