Greatest Common Divisor
Versión 1.0.0 (1,4 KB) por
Sambit Supriya Dash
Greatest number which could divide both the entered numbers fully (evenly).
Enter any two numbers, the code will find the every factor of the two numbers and will match them for the commonness and will find the maximum of the array to be called as the greatest common divisor of the two numbers.
Citar como
Sambit Supriya Dash (2024). Greatest Common Divisor (https://www.mathworks.com/matlabcentral/fileexchange/97647-greatest-common-divisor), MATLAB Central File Exchange. Recuperado .
Compatibilidad con la versión de MATLAB
Se creó con
R2021a
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS LinuxEtiquetas
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Descubra Live Editor
Cree scripts con código, salida y texto formateado en un documento ejecutable.
Versión | Publicado | Notas de la versión | |
---|---|---|---|
1.0.0 |