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:
“It was a maxim with Mr. Brass that the habit of paying compliments kept a man’s tongue oiled without any expense; and that, as that useful member ought never to grow rusty or creak in turning on its hinges in the case of a practitioner of the law, in whom it should be always glib and easy, he lost few opportunities of improving himself by the utterance of handsome speeches and eulogistic expressions”
—Charles Dickens (1812–1870)
“... there are persons who seem to have overcome obstacles and by character and perseverance to have risen to the top. But we have no record of the numbers of able persons who fall by the wayside, persons who, with enough encouragement and opportunity, might make great contributions.”
—Mary Barnett Gilson (1877–?)