Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,478; 8,871) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,478 = 2 × 3 × 11 × 83
5,478 is not a prime number but a composite one.
8,871 = 3 × 2,957
8,871 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,871 ÷ 5,478 = 1 + 3,393
Step 2. Divide the smaller number by the above operation's remainder:
5,478 ÷ 3,393 = 1 + 2,085
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
3,393 ÷ 2,085 = 1 + 1,308
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
2,085 ÷ 1,308 = 1 + 777
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
1,308 ÷ 777 = 1 + 531
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
777 ÷ 531 = 1 + 246
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
531 ÷ 246 = 2 + 39
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
246 ÷ 39 = 6 + 12
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
39 ÷ 12 = 3 + 3
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
12 ÷ 3 = 4 + 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 (5,478; 8,871) = 3
The two numbers have common prime factors