Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,042; 200,000,000,256) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,042 = 2 × 50,000,021
100,000,042 is not a prime number but a composite one.
200,000,000,256 = 28 × 3 × 7 × 5,843 × 6,367
200,000,000,256 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,256 ÷ 100,000,042 = 1,999 + 99,916,298
Step 2. Divide the smaller number by the above operation's remainder:
100,000,042 ÷ 99,916,298 = 1 + 83,744
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,916,298 ÷ 83,744 = 1,193 + 9,706
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
83,744 ÷ 9,706 = 8 + 6,096
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,706 ÷ 6,096 = 1 + 3,610
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,096 ÷ 3,610 = 1 + 2,486
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,610 ÷ 2,486 = 1 + 1,124
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,486 ÷ 1,124 = 2 + 238
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,124 ÷ 238 = 4 + 172
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
238 ÷ 172 = 1 + 66
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
172 ÷ 66 = 2 + 40
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
66 ÷ 40 = 1 + 26
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
40 ÷ 26 = 1 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
26 ÷ 14 = 1 + 12
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
14 ÷ 12 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
12 ÷ 2 = 6 + 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,042; 200,000,000,256) = 2
The two numbers have common prime factors