Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (35,910; 102,155) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
35,910 = 2 × 33 × 5 × 7 × 19
35,910 is not a prime number but a composite one.
102,155 = 5 × 20,431
102,155 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:
102,155 ÷ 35,910 = 2 + 30,335
Step 2. Divide the smaller number by the above operation's remainder:
35,910 ÷ 30,335 = 1 + 5,575
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
30,335 ÷ 5,575 = 5 + 2,460
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
5,575 ÷ 2,460 = 2 + 655
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
2,460 ÷ 655 = 3 + 495
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
655 ÷ 495 = 1 + 160
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
495 ÷ 160 = 3 + 15
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
160 ÷ 15 = 10 + 10
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
15 ÷ 10 = 1 + 5
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
10 ÷ 5 = 2 + 0
At this step, the remainder is zero, so we stop:
5 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 (35,910; 102,155) = 5
The two numbers have common prime factors