Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,898; 9,684) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,898 = 2 × 3 × 983
5,898 is not a prime number but a composite one.
9,684 = 22 × 32 × 269
9,684 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,684 ÷ 5,898 = 1 + 3,786
Step 2. Divide the smaller number by the above operation's remainder:
5,898 ÷ 3,786 = 1 + 2,112
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
3,786 ÷ 2,112 = 1 + 1,674
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
2,112 ÷ 1,674 = 1 + 438
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
1,674 ÷ 438 = 3 + 360
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
438 ÷ 360 = 1 + 78
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
360 ÷ 78 = 4 + 48
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
78 ÷ 48 = 1 + 30
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
48 ÷ 30 = 1 + 18
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
30 ÷ 18 = 1 + 12
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
18 ÷ 12 = 1 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
12 ÷ 6 = 2 + 0
At this step, the remainder is zero, so we stop:
6 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 (5,898; 9,684) = 6 = 2 × 3
The two numbers have common prime factors