Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,017; 200,000,000,200) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,017 = 32 × 13 × 31 × 79 × 349
100,000,017 is not a prime number but a composite one.
200,000,000,200 = 23 × 52 × 7 × 11 × 13 × 19 × 52,579
200,000,000,200 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,200 ÷ 100,000,017 = 1,999 + 99,966,217
Step 2. Divide the smaller number by the above operation's remainder:
100,000,017 ÷ 99,966,217 = 1 + 33,800
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,966,217 ÷ 33,800 = 2,957 + 19,617
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
33,800 ÷ 19,617 = 1 + 14,183
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
19,617 ÷ 14,183 = 1 + 5,434
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
14,183 ÷ 5,434 = 2 + 3,315
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,434 ÷ 3,315 = 1 + 2,119
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,315 ÷ 2,119 = 1 + 1,196
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,119 ÷ 1,196 = 1 + 923
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,196 ÷ 923 = 1 + 273
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
923 ÷ 273 = 3 + 104
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
273 ÷ 104 = 2 + 65
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
104 ÷ 65 = 1 + 39
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
65 ÷ 39 = 1 + 26
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
39 ÷ 26 = 1 + 13
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
26 ÷ 13 = 2 + 0
At this step, the remainder is zero, so we stop:
13 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,017; 200,000,000,200) = 13
The two numbers have common prime factors