Code covered by the BSD License  

Highlights from
egcd.m

from egcd.m by Steven Gregory
Extended greatest common divisor. Finds g = GCD(x(1), ..., x(end)) and v such that g == sum(v.*x).

All files for egcd.m
/egcd.m
/license.txt

Contact us at files@mathworks.com