Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (7,606; 4,672) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
7,606 = 2 × 3,803
7,606 is not a prime number but a composite one.
4,672 = 26 × 73
4,672 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:
7,606 ÷ 4,672 = 1 + 2,934
Step 2. Divide the smaller number by the above operation's remainder:
4,672 ÷ 2,934 = 1 + 1,738
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
2,934 ÷ 1,738 = 1 + 1,196
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,738 ÷ 1,196 = 1 + 542
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
1,196 ÷ 542 = 2 + 112
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
542 ÷ 112 = 4 + 94
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
112 ÷ 94 = 1 + 18
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
94 ÷ 18 = 5 + 4
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
18 ÷ 4 = 4 + 2
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4 ÷ 2 = 2 + 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 (7,606; 4,672) = 2
The two numbers have common prime factors