Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,934; 2,368) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,934 = 2 × 3 × 23 × 43
5,934 is not a prime number but a composite one.
2,368 = 26 × 37
2,368 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:
5,934 ÷ 2,368 = 2 + 1,198
Step 2. Divide the smaller number by the above operation's remainder:
2,368 ÷ 1,198 = 1 + 1,170
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,198 ÷ 1,170 = 1 + 28
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,170 ÷ 28 = 41 + 22
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
28 ÷ 22 = 1 + 6
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
22 ÷ 6 = 3 + 4
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6 ÷ 4 = 1 + 2
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
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 (5,934; 2,368) = 2
The two numbers have common prime factors