Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,102; 200,000,000,168) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,102 = 2 × 6,367 × 7,853
100,000,102 is not a prime number but a composite one.
200,000,000,168 = 23 × 25,000,000,021
200,000,000,168 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,168 ÷ 100,000,102 = 1,999 + 99,796,270
Step 2. Divide the smaller number by the above operation's remainder:
100,000,102 ÷ 99,796,270 = 1 + 203,832
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,796,270 ÷ 203,832 = 489 + 122,422
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
203,832 ÷ 122,422 = 1 + 81,410
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
122,422 ÷ 81,410 = 1 + 41,012
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
81,410 ÷ 41,012 = 1 + 40,398
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
41,012 ÷ 40,398 = 1 + 614
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
40,398 ÷ 614 = 65 + 488
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
614 ÷ 488 = 1 + 126
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
488 ÷ 126 = 3 + 110
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
126 ÷ 110 = 1 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
110 ÷ 16 = 6 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 14 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 2 = 7 + 0
At this step, the remainder is zero, so we stop:
2 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,102; 200,000,000,168) = 2
The two numbers have common prime factors