Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,150; 200,000,000,260) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,150 = 2 × 52 × 2,000,003
100,000,150 is not a prime number but a composite one.
200,000,000,260 = 22 × 5 × 18,041 × 554,293
200,000,000,260 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,260 ÷ 100,000,150 = 1,999 + 99,700,410
Step 2. Divide the smaller number by the above operation's remainder:
100,000,150 ÷ 99,700,410 = 1 + 299,740
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,700,410 ÷ 299,740 = 332 + 186,730
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
299,740 ÷ 186,730 = 1 + 113,010
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
186,730 ÷ 113,010 = 1 + 73,720
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
113,010 ÷ 73,720 = 1 + 39,290
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
73,720 ÷ 39,290 = 1 + 34,430
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
39,290 ÷ 34,430 = 1 + 4,860
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
34,430 ÷ 4,860 = 7 + 410
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,860 ÷ 410 = 11 + 350
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
410 ÷ 350 = 1 + 60
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
350 ÷ 60 = 5 + 50
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
60 ÷ 50 = 1 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
50 ÷ 10 = 5 + 0
At this step, the remainder is zero, so we stop:
10 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,150; 200,000,000,260) = 10 = 2 × 5
The two numbers have common prime factors