Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (2,763; 9,846) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
2,763 = 32 × 307
2,763 is not a prime number but a composite one.
9,846 = 2 × 32 × 547
9,846 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:
9,846 ÷ 2,763 = 3 + 1,557
Step 2. Divide the smaller number by the above operation's remainder:
2,763 ÷ 1,557 = 1 + 1,206
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,557 ÷ 1,206 = 1 + 351
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,206 ÷ 351 = 3 + 153
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
351 ÷ 153 = 2 + 45
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
153 ÷ 45 = 3 + 18
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
45 ÷ 18 = 2 + 9
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
18 ÷ 9 = 2 + 0
At this step, the remainder is zero, so we stop:
9 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 (2,763; 9,846) = 9 = 32
The two numbers have common prime factors