gcf (9,711; 6,370) = ? Calculate the greatest (highest) common factor (divisor) of numbers, gcf (hcf, gcd), by two methods: 1) The prime factorization and 2) The Euclidean Algorithm

gcf, hcf, gcd (9,711; 6,370) = ?

Method 1. The prime factorization:

The prime factorization of a number: finding the prime numbers that multiply together to make that number.


9,711 = 32 × 13 × 83
9,711 is not a prime number but a composite one.


6,370 = 2 × 5 × 72 × 13
6,370 is not a prime number but a composite one.


* The natural numbers that are only divisible by 1 and themselves are called prime numbers. A prime number has exactly two factors: 1 and itself.
* A composite number is 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 powers (exponents).


gcf, hcf, gcd (9,711; 6,370) = 13



gcf, hcf, gcd (9,711; 6,370) = 13
The two numbers have common prime factors.

Method 2. The Euclidean Algorithm:

This algorithm involves the process of dividing numbers and calculating the remainders.


'a' and 'b' are the two natural numbers, 'a' >= 'b'.


Divide 'a' by 'b' and get the remainder of the operation, 'r'.


If 'r' = 0, STOP. 'b' = the gcf (hcf, gcd) of 'a' and 'b'.


Else: Replace ('a' by 'b') and ('b' by 'r'). Return to the step above.



Step 1. Divide the larger number by the smaller one:
9,711 ÷ 6,370 = 1 + 3,341
Step 2. Divide the smaller number by the above operation's remainder:
6,370 ÷ 3,341 = 1 + 3,029
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
3,341 ÷ 3,029 = 1 + 312
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
3,029 ÷ 312 = 9 + 221
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
312 ÷ 221 = 1 + 91
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
221 ÷ 91 = 2 + 39
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
91 ÷ 39 = 2 + 13
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
39 ÷ 13 = 3 + 0
At this step, the remainder is zero, so we stop:
13 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 (9,711; 6,370) = 13


gcf, hcf, gcd (9,711; 6,370) = 13

The final answer:
The greatest (highest) common factor (divisor),
gcf, hcf, gcd (9,711; 6,370) = 13
The two numbers have common prime factors.

Why do we need to calculate the greatest common factor?

Once you've calculated the greatest common factor of the numerator and the denominator of a fraction, it becomes much easier to fully reduce (simplify) the fraction to the lowest terms (the smallest possible numerator and denominator).


The greatest (highest) common factor (divisor), gcf (hcf, gcd): the latest 5 calculated values

Calculator of the greatest (highest) common factor (divisor), gcf, hcf, gcd

Calculate the greatest (highest) common factor (divisor) of numbers, gcd, hcf, gcd:

Method 1: Run the prime factorization of the numbers - then multiply all the common prime factors, taken by their smallest exponents. If there are no common prime factors, then gcf equals 1.

Method 2: The Euclidean Algorithm.

Method 3: The divisibility of the numbers.

The greatest (highest) common factor (divisor), gcf, hcf, gcd. What it is and how to calculate it.


What is a prime number? Definition, examples

What is a composite number? Definition, examples

The prime numbers up to 1,000

The prime numbers up to 10,000

The Sieve of Eratosthenes

The Euclidean Algorithm

Completely reduce (simplify) fractions to the lowest terms: Steps and Examples