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:
“A woman’s whole life is a history of the affections. The heart is her world: it is there her ambition strives for empire; it is there her avarice seeks for hidden treasures. She sends forth her sympathies on adventure; she embarks her whole soul on the traffic of affection; and if shipwrecked, her case is hopeless—for it is a bankruptcy of the heart.”
—Washington Irving (1783–1859)
“I’m not even thinking straight any more. Numbers buzz in my head like wasps.”
—Kurt Neumann (1906–1958)