Code covered by the BSD License
|
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). |
|||
|---|---|---|---|
|
|||
Contact us at files@mathworks.com