Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,113; 200,000,000,103) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,113 = 3 × 23 × 67 × 97 × 223
100,000,113 is not a prime number but a composite one.
200,000,000,103 = 3 × 41 × 7,121 × 228,341
200,000,000,103 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,103 ÷ 100,000,113 = 1,999 + 99,774,216
Step 2. Divide the smaller number by the above operation's remainder:
100,000,113 ÷ 99,774,216 = 1 + 225,897
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,774,216 ÷ 225,897 = 441 + 153,639
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
225,897 ÷ 153,639 = 1 + 72,258
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
153,639 ÷ 72,258 = 2 + 9,123
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
72,258 ÷ 9,123 = 7 + 8,397
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,123 ÷ 8,397 = 1 + 726
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,397 ÷ 726 = 11 + 411
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
726 ÷ 411 = 1 + 315
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
411 ÷ 315 = 1 + 96
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
315 ÷ 96 = 3 + 27
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
96 ÷ 27 = 3 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
27 ÷ 15 = 1 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 12 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 3 = 4 + 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,113; 200,000,000,103) = 3
The two numbers have common prime factors