Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,100; 200,000,000,190) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,100 = 22 × 52 × 101 × 9,901
100,000,100 is not a prime number but a composite one.
200,000,000,190 = 2 × 3 × 5 × 73 × 373 × 244,837
200,000,000,190 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,190 ÷ 100,000,100 = 1,999 + 99,800,290
Step 2. Divide the smaller number by the above operation's remainder:
100,000,100 ÷ 99,800,290 = 1 + 199,810
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,800,290 ÷ 199,810 = 499 + 95,100
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
199,810 ÷ 95,100 = 2 + 9,610
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
95,100 ÷ 9,610 = 9 + 8,610
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,610 ÷ 8,610 = 1 + 1,000
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,610 ÷ 1,000 = 8 + 610
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,000 ÷ 610 = 1 + 390
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
610 ÷ 390 = 1 + 220
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
390 ÷ 220 = 1 + 170
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
220 ÷ 170 = 1 + 50
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
170 ÷ 50 = 3 + 20
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
50 ÷ 20 = 2 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
20 ÷ 10 = 2 + 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,100; 200,000,000,190) = 10 = 2 × 5
The two numbers have common prime factors