Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,150; 200,000,000,078) = ?
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,078 = 2 × 16,187 × 6,177,797
200,000,000,078 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,078 ÷ 100,000,150 = 1,999 + 99,700,228
Step 2. Divide the smaller number by the above operation's remainder:
100,000,150 ÷ 99,700,228 = 1 + 299,922
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,700,228 ÷ 299,922 = 332 + 126,124
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
299,922 ÷ 126,124 = 2 + 47,674
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
126,124 ÷ 47,674 = 2 + 30,776
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
47,674 ÷ 30,776 = 1 + 16,898
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
30,776 ÷ 16,898 = 1 + 13,878
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
16,898 ÷ 13,878 = 1 + 3,020
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
13,878 ÷ 3,020 = 4 + 1,798
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,020 ÷ 1,798 = 1 + 1,222
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,798 ÷ 1,222 = 1 + 576
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
1,222 ÷ 576 = 2 + 70
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
576 ÷ 70 = 8 + 16
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
70 ÷ 16 = 4 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
16 ÷ 6 = 2 + 4
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 4 = 1 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
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,078) = 2
The two numbers have common prime factors