Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,042; 200,000,000,760) = ?
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,760 = 23 × 3 × 5 × 7 × 53 × 179 × 25,097
200,000,000,760 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,760 ÷ 100,000,042 = 1,999 + 99,916,802
Step 2. Divide the smaller number by the above operation's remainder:
100,000,042 ÷ 99,916,802 = 1 + 83,240
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,916,802 ÷ 83,240 = 1,200 + 28,802
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
83,240 ÷ 28,802 = 2 + 25,636
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
28,802 ÷ 25,636 = 1 + 3,166
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
25,636 ÷ 3,166 = 8 + 308
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,166 ÷ 308 = 10 + 86
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
308 ÷ 86 = 3 + 50
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
86 ÷ 50 = 1 + 36
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
50 ÷ 36 = 1 + 14
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
36 ÷ 14 = 2 + 8
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
14 ÷ 8 = 1 + 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,042; 200,000,000,760) = 2
The two numbers have common prime factors