Categories
All Calculators
Math
Algebra Calculators
Greatest Common Divisor (GCD, GCF, HCF) Calculator

Greatest Common Divisor (GCD, GCF, HCF) Calculator

Enter values
Last update: 2024-06-18
0/0
Result:
4
Solution steps
1.
Sort numbers from largest to smallest
= 20, 12, 8
2.
Find GCD of 20 and 12 using Euclid's Algorithm
1.
Calculate the modulo using the Modulo Calculator
1.
Calculate the modulo
mod(20,12)
mod(20,12)
= 8
2.
20 = 1 * 12 + 8
= Remainder 8
3.
8 > 0. Repeat calculation
1.
Calculate the modulo
mod(12,8)
mod(12,8)
= 4
4.
12 = 1 * 8 + 4
= Remainder 4
5.
4 > 0. Repeat calculation
1.
Calculate the modulo
mod(8,4)
mod(8,4)
= 0
6.
8 = 2 * 4 + 0
= Remainder 0
7.
Mod = 0
= 4
3.
Find GCD of 4 and 8 using Euclid's Algorithm
1.
Calculate the modulo using the Modulo Calculator
1.
Calculate the modulo
mod(8,4)
mod(8,4)
= 0
2.
4 = 0.5 * 8 + 0
= Remainder 0
3.
Mod = 0
= 4
Rating: 0
Votes: 0

Related calculators

Euclid's Algorithm Calculator
Roots Calculator
Exponent Calculator
Exponential Function Calculator
Logarithm Calculator
Check out 5 similar algebra calculators
Menu
Math
26
Arithmetic
4
Algebra
6
Percentages
13
Angles
1
Fractions
2
Conversion
2
Biology
1
Bio Laboratory
1
Contact
Help
Privacy policy