GCD of 789, 985, 431 Calculator

Given Input numbers are 789, 985, 431

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

Divisors of 789

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

1, 3, 263, 789

Divisors of 985

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

1, 5, 197, 985

Divisors of 431

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

1, 431

Greatest Common Divisior

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

Therefore, GCD of numbers 789, 985, 431 is 1

Given Input Data is 789, 985, 431

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

Prime Factorization of 789 is 3 x 263

Prime Factorization of 985 is 5 x 197

Prime Factorization of 431 is 431

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(789, 985) = 777165

GCD(789, 985) = ( 789 x 985 ) / 777165

GCD(789, 985) = 777165 / 777165

GCD(789, 985) = 1

Step2:

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

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

LCM(1, 431) = 431

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

GCD(1, 431) = 431 / 431

GCD(1, 431) = 1

GCD of 789, 985, 431 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 753, 983, 887
• GCD of 205, 385, 533
• GCD of 701, 332, 291
• GCD of 689, 270, 214
• GCD of 789, 300, 941

1. What is the GCD of 789, 985, 431?

GCD of 789, 985, 431 is 1

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

You can find a detailed procedure to find GCD of 789, 985, 431 on our page.

3. How to find GCD of 789, 985, 431 on a calculator?

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