Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,002; 200,000,000,182) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,002 = 2 × 3 × 19 × 739 × 1,187
100,000,002 is not a prime number but a composite one.
200,000,000,182 = 2 × 100,000,000,091
200,000,000,182 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,182 ÷ 100,000,002 = 1,999 + 99,996,184
Step 2. Divide the smaller number by the above operation's remainder:
100,000,002 ÷ 99,996,184 = 1 + 3,818
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,996,184 ÷ 3,818 = 26,190 + 2,764
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
3,818 ÷ 2,764 = 1 + 1,054
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
2,764 ÷ 1,054 = 2 + 656
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,054 ÷ 656 = 1 + 398
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
656 ÷ 398 = 1 + 258
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
398 ÷ 258 = 1 + 140
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
258 ÷ 140 = 1 + 118
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
140 ÷ 118 = 1 + 22
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
118 ÷ 22 = 5 + 8
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
22 ÷ 8 = 2 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
8 ÷ 6 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 2 = 3 + 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,002; 200,000,000,182) = 2
The two numbers have common prime factors