The
greatest common divisor (GCD) of two positive
integers is the largest positive
integer that divides the numbers without a remainder.
For example the GCD of 24 & 40 is 8
The Greatest Common Divisor (GCD) of two whole numbers also called
the Greatest Common Factor (GCF)
& the Highest Common Factor (HCF).
There is a simple & systematic way of
finding the GCD of two positive integers.That method is called “Euclid’s Algorithm”. This algorithm finds GCD by performing repeated divisions starting from the two
numbers we want to find the GCD of until we get a remainder of 0.
•Divide the larger number by the smaller one and get the remainder•If remainder is not zero, we divide the smaller number by the remainder from the last division
•Repeat the above step until we get the remainder as zero
•The last divisor or number we used to divide is the GCD
To write the program in C,
To create the Greatest Common Divisor App,
Click here to Watch on YouTube
Click here to Watch on YouTube
To Download the Greatest Common Divisor Android App
Comments
Post a Comment