Best GCf calculator
- By : Guest user
- Category : BOOKMARKING
- Tags: education
GCD (8, 10, 12) = 2
You can also verify the GCF using the continuous division calculator above.
4. Euclidean algorithm
Step 1:
Arrange the numbers in ascending order
8, 10, 12
Step 2:
Divide all numbers with the smallest number. Use modulo operation % to get the remainders.
10 mod 8 = 2
12 mod 8 = 4
Step 3:
Take the divisor and remainders and arrange them in ascending order
2, 4, 8
Step 4:
Repeat the previous step for 2, 4, and 8 (Take the modulo of the numbers with the smallest one).
4 mod 2 = 0
8 mod 2 = 0
Step 5:
Again take the divisor and remainders and arrange them in ascending order.
0, 0, 2 →2You can see, there is only one number left which is 2. So the greatest common divisor is 2.
https://www.gcfcalculator.net/
No Comments