Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,102; 200,000,000,378) = ?
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,378 = 2 × 97 × 1,030,927,837
200,000,000,378 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,378 ÷ 100,000,102 = 1,999 + 99,796,480
Step 2. Divide the smaller number by the above operation's remainder:
100,000,102 ÷ 99,796,480 = 1 + 203,622
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,796,480 ÷ 203,622 = 490 + 21,700
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
203,622 ÷ 21,700 = 9 + 8,322
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
21,700 ÷ 8,322 = 2 + 5,056
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,322 ÷ 5,056 = 1 + 3,266
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,056 ÷ 3,266 = 1 + 1,790
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,266 ÷ 1,790 = 1 + 1,476
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,790 ÷ 1,476 = 1 + 314
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,476 ÷ 314 = 4 + 220
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
314 ÷ 220 = 1 + 94
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
220 ÷ 94 = 2 + 32
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
94 ÷ 32 = 2 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
32 ÷ 30 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
30 ÷ 2 = 15 + 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,378) = 2
The two numbers have common prime factors