Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,142; 200,000,000,197) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,142 = 2 × 11 × 4,545,461
100,000,142 is not a prime number but a composite one.
200,000,000,197 is a prime number and cannot be broken down into other prime factors.
- 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).
But the two numbers have no common prime factors.
Step 1. Divide the larger number by the smaller one:
200,000,000,197 ÷ 100,000,142 = 1,999 + 99,716,339
Step 2. Divide the smaller number by the above operation's remainder:
100,000,142 ÷ 99,716,339 = 1 + 283,803
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,716,339 ÷ 283,803 = 351 + 101,486
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
283,803 ÷ 101,486 = 2 + 80,831
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
101,486 ÷ 80,831 = 1 + 20,655
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
80,831 ÷ 20,655 = 3 + 18,866
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
20,655 ÷ 18,866 = 1 + 1,789
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
18,866 ÷ 1,789 = 10 + 976
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,789 ÷ 976 = 1 + 813
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
976 ÷ 813 = 1 + 163
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
813 ÷ 163 = 4 + 161
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
163 ÷ 161 = 1 + 2
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
161 ÷ 2 = 80 + 1
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
2 ÷ 1 = 2 + 0
At this step, the remainder is zero, so we stop:
1 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,142; 200,000,000,197) = 1
Coprime numbers (prime to each other, relatively prime).
The two numbers have no prime factors in common