Greatest Common Divisor

Greatest number which could divide both the entered numbers fully (evenly).
2 téléchargements
Mise à jour 15 août 2021

Afficher la licence

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.

Citation pour cette source

Sambit Supriya Dash (2024). Greatest Common Divisor (https://www.mathworks.com/matlabcentral/fileexchange/97647-greatest-common-divisor), MATLAB Central File Exchange. Récupéré le .

Compatibilité avec les versions de MATLAB
Créé avec R2021a
Compatible avec toutes les versions
Plateformes compatibles
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Publié le Notes de version
1.0.0