Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,101; 200,000,000,745) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,101 = 3 × 167 × 199,601
100,000,101 is not a prime number but a composite one.
200,000,000,745 = 33 × 5 × 1,481,481,487
200,000,000,745 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,745 ÷ 100,000,101 = 1,999 + 99,798,846
Step 2. Divide the smaller number by the above operation's remainder:
100,000,101 ÷ 99,798,846 = 1 + 201,255
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,798,846 ÷ 201,255 = 495 + 177,621
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
201,255 ÷ 177,621 = 1 + 23,634
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
177,621 ÷ 23,634 = 7 + 12,183
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,634 ÷ 12,183 = 1 + 11,451
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
12,183 ÷ 11,451 = 1 + 732
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
11,451 ÷ 732 = 15 + 471
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
732 ÷ 471 = 1 + 261
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
471 ÷ 261 = 1 + 210
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
261 ÷ 210 = 1 + 51
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
210 ÷ 51 = 4 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
51 ÷ 6 = 8 + 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,101; 200,000,000,745) = 3
The two numbers have common prime factors