Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,050; 200,000,000,979) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,050 = 2 × 3 × 52 × 666,667
100,000,050 is not a prime number but a composite one.
200,000,000,979 = 32 × 19 × 1,169,590,649
200,000,000,979 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,979 ÷ 100,000,050 = 1,999 + 99,901,029
Step 2. Divide the smaller number by the above operation's remainder:
100,000,050 ÷ 99,901,029 = 1 + 99,021
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,901,029 ÷ 99,021 = 1,008 + 87,861
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
99,021 ÷ 87,861 = 1 + 11,160
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
87,861 ÷ 11,160 = 7 + 9,741
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
11,160 ÷ 9,741 = 1 + 1,419
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,741 ÷ 1,419 = 6 + 1,227
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,419 ÷ 1,227 = 1 + 192
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,227 ÷ 192 = 6 + 75
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
192 ÷ 75 = 2 + 42
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
75 ÷ 42 = 1 + 33
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
42 ÷ 33 = 1 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
33 ÷ 9 = 3 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
9 ÷ 6 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,050; 200,000,000,979) = 3
The two numbers have common prime factors