CS261 at UNM
This is a repository containing solutions to problems from UNM's CS261 discrete mathematics course. extended_euclid.py is a simple program implementing the Extended Euclidean algorithm. It finds the greatest common divisor of any two integers along with the coefficients necessary to satisfy Bezout's identity.