Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (4,329; 7,383) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
4,329 = 32 × 13 × 37
4,329 is not a prime number but a composite one.
7,383 = 3 × 23 × 107
7,383 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,383 ÷ 4,329 = 1 + 3,054
Step 2. Divide the smaller number by the above operation's remainder:
4,329 ÷ 3,054 = 1 + 1,275
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
3,054 ÷ 1,275 = 2 + 504
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,275 ÷ 504 = 2 + 267
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
504 ÷ 267 = 1 + 237
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
267 ÷ 237 = 1 + 30
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
237 ÷ 30 = 7 + 27
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
30 ÷ 27 = 1 + 3
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
27 ÷ 3 = 9 + 0
At this step, the remainder is zero, so we stop:
3 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 (4,329; 7,383) = 3
The two numbers have common prime factors