Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,203; 200,000,001,000) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,203 = 3 × 31 × 151 × 7,121
100,000,203 is not a prime number but a composite one.
200,000,001,000 = 23 × 3 × 53 × 66,666,667
200,000,001,000 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,001,000 ÷ 100,000,203 = 1,999 + 99,595,203
Step 2. Divide the smaller number by the above operation's remainder:
100,000,203 ÷ 99,595,203 = 1 + 405,000
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,595,203 ÷ 405,000 = 245 + 370,203
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
405,000 ÷ 370,203 = 1 + 34,797
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
370,203 ÷ 34,797 = 10 + 22,233
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
34,797 ÷ 22,233 = 1 + 12,564
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
22,233 ÷ 12,564 = 1 + 9,669
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12,564 ÷ 9,669 = 1 + 2,895
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
9,669 ÷ 2,895 = 3 + 984
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,895 ÷ 984 = 2 + 927
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
984 ÷ 927 = 1 + 57
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
927 ÷ 57 = 16 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
57 ÷ 15 = 3 + 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,203; 200,000,001,000) = 3
The two numbers have common prime factors