GCD of 985, 797, 291 Calculator

Given Input numbers are 985, 797, 291

To find the GCD of numbers using factoring list out all the divisors of each number

Divisors of 985

List of positive integer divisors of 985 that divides 985 without a remainder.

1, 5, 197, 985

Divisors of 797

List of positive integer divisors of 797 that divides 797 without a remainder.

1, 797

Divisors of 291

List of positive integer divisors of 291 that divides 291 without a remainder.

1, 3, 97, 291

Greatest Common Divisior

We found the divisors of 985, 797, 291 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 985, 797, 291 is 1.

Therefore, GCD of numbers 985, 797, 291 is 1

Given Input Data is 985, 797, 291

Make a list of Prime Factors of all the given numbers initially

Prime Factorization of 985 is 5 x 197

Prime Factorization of 797 is 797

Prime Factorization of 291 is 3 x 97

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

Step1:

Let's calculate the GCD of first two numbers

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

LCM(985, 797) = 785045

GCD(985, 797) = ( 985 x 797 ) / 785045

GCD(985, 797) = 785045 / 785045

GCD(985, 797) = 1

Step2:

Here we consider the GCD from the above i.e. 1 as first number and the next as 291

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

LCM(1, 291) = 291

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

GCD(1, 291) = 291 / 291

GCD(1, 291) = 1

GCD of 985, 797, 291 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 440, 959, 212
• GCD of 373, 971, 332
• GCD of 308, 572, 157
• GCD of 815, 766, 798
• GCD of 347, 827, 722

1. What is the GCD of 985, 797, 291?

GCD of 985, 797, 291 is 1

2. Where do I get the detailed procedure to find GCD of 985, 797, 291?

You can find a detailed procedure to find GCD of 985, 797, 291 on our page.

3. How to find GCD of 985, 797, 291 on a calculator?

You can find the GCD of 985, 797, 291 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.