egcd.m
Extended greatest common divisor. Finds g = GCD(x(1), ..., x(end)) and v such that g == sum(v.*x).
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
[g v] = egcd(x) returns g = gcd(x(1), x(2), ..., x(end)) and v such that g == sum(v.*abs(x)).
Cite As
Steven Gregory (2026). egcd.m (https://www.mathworks.com/matlabcentral/fileexchange/23944-egcd-m), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired by: nextperm, modinv(x, N), logmod
General Information
- Version 1.1.0.0 (1.45 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
