Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,042; 200,000,000,190) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,042 = 2 × 50,000,021
100,000,042 is not a prime number but a composite one.
200,000,000,190 = 2 × 3 × 5 × 73 × 373 × 244,837
200,000,000,190 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,190 ÷ 100,000,042 = 1,999 + 99,916,232
Step 2. Divide the smaller number by the above operation's remainder:
100,000,042 ÷ 99,916,232 = 1 + 83,810
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,916,232 ÷ 83,810 = 1,192 + 14,712
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
83,810 ÷ 14,712 = 5 + 10,250
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
14,712 ÷ 10,250 = 1 + 4,462
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
10,250 ÷ 4,462 = 2 + 1,326
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,462 ÷ 1,326 = 3 + 484
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,326 ÷ 484 = 2 + 358
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
484 ÷ 358 = 1 + 126
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
358 ÷ 126 = 2 + 106
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
126 ÷ 106 = 1 + 20
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
106 ÷ 20 = 5 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
20 ÷ 6 = 3 + 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,042; 200,000,000,190) = 2
The two numbers have common prime factors