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 new talker will often call her caregiver “mommy,” which makes parents worry that the child is confused about who is who. She isn’t. This is a case of limited vocabulary rather than mixed-up identities. When a child has only one word for the female person who takes care of her, calling both of them “mommy” is understandable.”
—Amy Laura Dombro (20th century)
“... 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–?)