Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,100; 200,000,000,124) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,100 = 22 × 52 × 101 × 9,901
100,000,100 is not a prime number but a composite one.
200,000,000,124 = 22 × 35 × 19 × 53 × 204,331
200,000,000,124 is not a prime number but a composite one.
- Prime number: a natural number that is only divisible by 1 and itself. A prime number has exactly two factors: 1 and itself.
- Composite number: a natural number that has at least one other factor than 1 and itself.
Calculate the greatest (highest) common factor (divisor):
Multiply all the common prime factors, taken by their smallest exponents (the smallest powers).
Step 1. Divide the larger number by the smaller one:
200,000,000,124 ÷ 100,000,100 = 1,999 + 99,800,224
Step 2. Divide the smaller number by the above operation's remainder:
100,000,100 ÷ 99,800,224 = 1 + 199,876
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,800,224 ÷ 199,876 = 499 + 62,100
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
199,876 ÷ 62,100 = 3 + 13,576
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
62,100 ÷ 13,576 = 4 + 7,796
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,576 ÷ 7,796 = 1 + 5,780
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,796 ÷ 5,780 = 1 + 2,016
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,780 ÷ 2,016 = 2 + 1,748
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,016 ÷ 1,748 = 1 + 268
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,748 ÷ 268 = 6 + 140
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
268 ÷ 140 = 1 + 128
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
140 ÷ 128 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
128 ÷ 12 = 10 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 8 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 4 = 2 + 0
At this step, the remainder is zero, so we stop:
4 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
The greatest (highest) common factor (divisor):
gcf, hcf, gcd (100,000,100; 200,000,000,124) = 4 = 22
The two numbers have common prime factors