Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,004; 200,000,000,050) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,004 = 22 × 132 × 29 × 5,101
100,000,004 is not a prime number but a composite one.
200,000,000,050 = 2 × 52 × 47 × 127 × 670,129
200,000,000,050 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,050 ÷ 100,000,004 = 1,999 + 99,992,054
Step 2. Divide the smaller number by the above operation's remainder:
100,000,004 ÷ 99,992,054 = 1 + 7,950
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,992,054 ÷ 7,950 = 12,577 + 4,904
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
7,950 ÷ 4,904 = 1 + 3,046
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
4,904 ÷ 3,046 = 1 + 1,858
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,046 ÷ 1,858 = 1 + 1,188
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,858 ÷ 1,188 = 1 + 670
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,188 ÷ 670 = 1 + 518
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
670 ÷ 518 = 1 + 152
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
518 ÷ 152 = 3 + 62
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
152 ÷ 62 = 2 + 28
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
62 ÷ 28 = 2 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
28 ÷ 6 = 4 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 4 = 1 + 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,004; 200,000,000,050) = 2
The two numbers have common prime factors