Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,083; 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,083 = 3 × 227 × 146,843
100,000,083 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,083 = 1,999 + 99,834,186
Step 2. Divide the smaller number by the above operation's remainder:
100,000,083 ÷ 99,834,186 = 1 + 165,897
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,834,186 ÷ 165,897 = 601 + 130,089
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
165,897 ÷ 130,089 = 1 + 35,808
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
130,089 ÷ 35,808 = 3 + 22,665
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
35,808 ÷ 22,665 = 1 + 13,143
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
22,665 ÷ 13,143 = 1 + 9,522
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,143 ÷ 9,522 = 1 + 3,621
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
9,522 ÷ 3,621 = 2 + 2,280
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,621 ÷ 2,280 = 1 + 1,341
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,280 ÷ 1,341 = 1 + 939
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
1,341 ÷ 939 = 1 + 402
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
939 ÷ 402 = 2 + 135
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
402 ÷ 135 = 2 + 132
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
135 ÷ 132 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
132 ÷ 3 = 44 + 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,083; 200,000,000,103) = 3
The two numbers have common prime factors