Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,336; 8,460) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,336 = 23 × 23 × 29
5,336 is not a prime number but a composite one.
8,460 = 22 × 32 × 5 × 47
8,460 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:
8,460 ÷ 5,336 = 1 + 3,124
Step 2. Divide the smaller number by the above operation's remainder:
5,336 ÷ 3,124 = 1 + 2,212
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
3,124 ÷ 2,212 = 1 + 912
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
2,212 ÷ 912 = 2 + 388
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
912 ÷ 388 = 2 + 136
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
388 ÷ 136 = 2 + 116
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
136 ÷ 116 = 1 + 20
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
116 ÷ 20 = 5 + 16
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
20 ÷ 16 = 1 + 4
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
16 ÷ 4 = 4 + 0
At this step, the remainder is zero, so we stop:
4 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,336; 8,460) = 4 = 22
The two numbers have common prime factors