Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,050; 200,000,000,799) = ?
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,799 = 33 × 31 × 37 × 6,458,071
200,000,000,799 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,799 ÷ 100,000,050 = 1,999 + 99,900,849
Step 2. Divide the smaller number by the above operation's remainder:
100,000,050 ÷ 99,900,849 = 1 + 99,201
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,900,849 ÷ 99,201 = 1,007 + 5,442
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
99,201 ÷ 5,442 = 18 + 1,245
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
5,442 ÷ 1,245 = 4 + 462
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,245 ÷ 462 = 2 + 321
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
462 ÷ 321 = 1 + 141
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
321 ÷ 141 = 2 + 39
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
141 ÷ 39 = 3 + 24
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
39 ÷ 24 = 1 + 15
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
24 ÷ 15 = 1 + 9
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
15 ÷ 9 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
9 ÷ 6 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,799) = 3
The two numbers have common prime factors