GCD of 773, 645, 979 Calculator

Given Input numbers are 773, 645, 979

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

Divisors of 773

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

1, 773

Divisors of 645

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

1, 3, 5, 15, 43, 129, 215, 645

Divisors of 979

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

1, 11, 89, 979

Greatest Common Divisior

We found the divisors of 773, 645, 979 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 773, 645, 979 is 1.

Therefore, GCD of numbers 773, 645, 979 is 1

Given Input Data is 773, 645, 979

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

Prime Factorization of 773 is 773

Prime Factorization of 645 is 3 x 5 x 43

Prime Factorization of 979 is 11 x 89

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(773, 645) = 498585

GCD(773, 645) = ( 773 x 645 ) / 498585

GCD(773, 645) = 498585 / 498585

GCD(773, 645) = 1

Step2:

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

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

LCM(1, 979) = 979

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

GCD(1, 979) = 979 / 979

GCD(1, 979) = 1

GCD of 773, 645, 979 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 964, 322, 891
• GCD of 393, 218, 954
• GCD of 269, 472, 651
• GCD of 672, 917, 332
• GCD of 188, 406, 970

1. What is the GCD of 773, 645, 979?

GCD of 773, 645, 979 is 1

2. Where do I get the detailed procedure to find GCD of 773, 645, 979?

You can find a detailed procedure to find GCD of 773, 645, 979 on our page.

3. How to find GCD of 773, 645, 979 on a calculator?

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