(New page: This is the Extended Euclid algorithm we talked about last Thursday. Kind of cool, plug it into your favorite programming language. def eeuclid(a,b) if a % b = 0: return [0,1...) |
|||
| Line 1: | Line 1: | ||
| + | [[Category:MA453Spring2009Walther]] | ||
This is the Extended Euclid algorithm we talked about last Thursday. Kind of cool, plug it into your favorite programming language. | This is the Extended Euclid algorithm we talked about last Thursday. Kind of cool, plug it into your favorite programming language. | ||
Revision as of 11:15, 28 January 2009
This is the Extended Euclid algorithm we talked about last Thursday. Kind of cool, plug it into your favorite programming language.
def eeuclid(a,b)
if a % b = 0:
return [0,1]
else
[c,d] = eeuclid(b, a % b)
return [y, x - y*(a/b)]
