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:
“I often used to think myself in the case of the fox-hunter, who, when he had toiled and sweated all day in the chase as if some unheard-of blessing was to crown his success, finds at last all he has got by his labor is a stinking nauseous animal. But my condition was yet worse than his; for he leaves the loathsome wretch to be torn by his hounds, whilst I was obliged to fondle mine, and meanly pretend him to be the object of my love.”
—Sarah Fielding (1710–1768)
“And when all bodies meet
In Lethe to be drowned,
Then only numbers sweet
With endless life are crowned.”
—Robert Herrick (1591–1674)