Greatest Common Divisor
In this program we are going to lend to the user for two values and then going to show the gcd.
In mathematics, the Greatest Common Divisor of two or more integers, when at least one of them is not zero, is the largest positive integer that divides the numbers without a remainder.
For example: The Common Divisor of: 8 and 6 is: 2.
Enjoy the program, and if you have any question about that, dont doubt asking me.
Next, I share the image of the program working.
(If you want to see the image in full screen, clik on the image).
Here is my code in GitHub, i hope help you 🙂.
Soon I will going to update this post with the steps to make this program run.
Best regards.
_Ernesto Gutiérrez Valdés
#WSQ12 #NETO #TC1014 by ernestogtza00817392 is licensed under a Creative Commons Attribution 4.0 International License.