Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,029; 199,999,999,950) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,029 = 3 × 53 × 131 × 4,801
100,000,029 is not a prime number but a composite one.
199,999,999,950 = 2 × 3 × 52 × 157 × 8,492,569
199,999,999,950 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:
199,999,999,950 ÷ 100,000,029 = 1,999 + 99,941,979
Step 2. Divide the smaller number by the above operation's remainder:
100,000,029 ÷ 99,941,979 = 1 + 58,050
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,941,979 ÷ 58,050 = 1,721 + 37,929
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
58,050 ÷ 37,929 = 1 + 20,121
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
37,929 ÷ 20,121 = 1 + 17,808
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
20,121 ÷ 17,808 = 1 + 2,313
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,808 ÷ 2,313 = 7 + 1,617
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,313 ÷ 1,617 = 1 + 696
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,617 ÷ 696 = 2 + 225
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
696 ÷ 225 = 3 + 21
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
225 ÷ 21 = 10 + 15
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
21 ÷ 15 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
15 ÷ 6 = 2 + 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,029; 199,999,999,950) = 3
The two numbers have common prime factors