Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,150; 200,000,000,422) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,150 = 2 × 52 × 2,000,003
100,000,150 is not a prime number but a composite one.
200,000,000,422 = 2 × 100,000,000,211
200,000,000,422 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,422 ÷ 100,000,150 = 1,999 + 99,700,572
Step 2. Divide the smaller number by the above operation's remainder:
100,000,150 ÷ 99,700,572 = 1 + 299,578
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,700,572 ÷ 299,578 = 332 + 240,676
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
299,578 ÷ 240,676 = 1 + 58,902
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
240,676 ÷ 58,902 = 4 + 5,068
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
58,902 ÷ 5,068 = 11 + 3,154
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,068 ÷ 3,154 = 1 + 1,914
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,154 ÷ 1,914 = 1 + 1,240
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,914 ÷ 1,240 = 1 + 674
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,240 ÷ 674 = 1 + 566
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
674 ÷ 566 = 1 + 108
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
566 ÷ 108 = 5 + 26
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
108 ÷ 26 = 4 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
26 ÷ 4 = 6 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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,150; 200,000,000,422) = 2
The two numbers have common prime factors