Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,100; 200,000,000,282) = ?
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,282 = 2 × 65,809 × 1,519,549
200,000,000,282 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,282 ÷ 100,000,100 = 1,999 + 99,800,382
Step 2. Divide the smaller number by the above operation's remainder:
100,000,100 ÷ 99,800,382 = 1 + 199,718
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,800,382 ÷ 199,718 = 499 + 141,100
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
199,718 ÷ 141,100 = 1 + 58,618
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
141,100 ÷ 58,618 = 2 + 23,864
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
58,618 ÷ 23,864 = 2 + 10,890
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
23,864 ÷ 10,890 = 2 + 2,084
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
10,890 ÷ 2,084 = 5 + 470
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,084 ÷ 470 = 4 + 204
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
470 ÷ 204 = 2 + 62
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
204 ÷ 62 = 3 + 18
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
62 ÷ 18 = 3 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
18 ÷ 8 = 2 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 2 = 4 + 0
At this step, the remainder is zero, so we stop:
2 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,282) = 2
The two numbers have common prime factors