Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,263; 200,000,000,279) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,263 = 3 × 11 × 821 × 3,691
100,000,263 is not a prime number but a composite one.
200,000,000,279 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,279 ÷ 100,000,263 = 1,999 + 99,474,542
Step 2. Divide the smaller number by the above operation's remainder:
100,000,263 ÷ 99,474,542 = 1 + 525,721
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,474,542 ÷ 525,721 = 189 + 113,273
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
525,721 ÷ 113,273 = 4 + 72,629
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
113,273 ÷ 72,629 = 1 + 40,644
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
72,629 ÷ 40,644 = 1 + 31,985
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
40,644 ÷ 31,985 = 1 + 8,659
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
31,985 ÷ 8,659 = 3 + 6,008
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
8,659 ÷ 6,008 = 1 + 2,651
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
6,008 ÷ 2,651 = 2 + 706
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,651 ÷ 706 = 3 + 533
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
706 ÷ 533 = 1 + 173
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
533 ÷ 173 = 3 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
173 ÷ 14 = 12 + 5
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
14 ÷ 5 = 2 + 4
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
5 ÷ 4 = 1 + 1
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
4 ÷ 1 = 4 + 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,263; 200,000,000,279) = 1
Coprime numbers (prime to each other, relatively prime).
The two numbers have no prime factors in common