Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (34,142; 9,680) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
34,142 = 2 × 43 × 397
34,142 is not a prime number but a composite one.
9,680 = 24 × 5 × 112
9,680 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:
34,142 ÷ 9,680 = 3 + 5,102
Step 2. Divide the smaller number by the above operation's remainder:
9,680 ÷ 5,102 = 1 + 4,578
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
5,102 ÷ 4,578 = 1 + 524
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
4,578 ÷ 524 = 8 + 386
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
524 ÷ 386 = 1 + 138
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
386 ÷ 138 = 2 + 110
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
138 ÷ 110 = 1 + 28
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
110 ÷ 28 = 3 + 26
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
28 ÷ 26 = 1 + 2
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
26 ÷ 2 = 13 + 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 (34,142; 9,680) = 2
The two numbers have common prime factors