GCD of 979, 701, 108 Calculator

Given Input numbers are 979, 701, 108

In the factoring method, we have to find the divisors of all numbers

Divisors of 979 :

The positive integer divisors of 979 that completely divides 979 are.

1, 11, 89, 979

Divisors of 701 :

The positive integer divisors of 701 that completely divides 701 are.

1, 701

Divisors of 108 :

The positive integer divisors of 108 that completely divides 108 are.

1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108

GCD of numbers is the greatest common divisor

So, the GCD (979, 701, 108) = 1.

Given numbers are 979, 701, 108

The list of prime factors of all numbers are

Prime factors of 979 are 11 x 89

Prime factors of 701 are 701

Prime factors of 108 are 2 x 2 x 3 x 3 x 3

The above numbers do not have any common prime factor. So GCD is 1

Given numbers are 979, 701, 108

GCD of 2 numbers formula is GCD(a, b) = ( a x b) / LCM(a, b)

Apply this formula for all numbers.

Step1:

LCM(979, 701) = 686279

GCD(979, 701) = ( 979 x 701 ) / 686279

= 979 / 701

= 979

Step2:

LCM(1, 108) = 108

GCD(1, 108) = ( 1 x 108 ) / 108

= 1 / 108

= 1

So, Greatest Common Divisor of 979, 701, 108 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 840, 393, 473
• GCD of 104, 815, 753
• GCD of 252, 725, 159
• GCD of 553, 189, 382
• GCD of 454, 966, 163

Given numbers are 979, 701, 108
The greatest common divisor of numbers 979, 701, 108 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 979, 701, 108 is 1.

1. What is the GCD of 979, 701, 108?

GCD of given numbers 979, 701, 108 is 1

2. How to calculate the greatest common divisor of 979, 701, 108?

We can find the highest common divisor of 979, 701, 108 easily using the prime factorization method. Just list the prime factors of all numbers and pick the highest common factor which is the GCD of 979, 701, 108 i.e 1.

3. How can I use the GCD of 979, 701, 108Calculator?

Out the numbers 979, 701, 108 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.