GCD of 737, 978, 51 Calculator

Given Input numbers are 737, 978, 51

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

Divisors of 737

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

1, 11, 67, 737

Divisors of 978

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

1, 2, 3, 6, 163, 326, 489, 978

Divisors of 51

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

1, 3, 17, 51

Greatest Common Divisior

We found the divisors of 737, 978, 51 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 737, 978, 51 is 1.

Therefore, GCD of numbers 737, 978, 51 is 1

Given Input Data is 737, 978, 51

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

Prime Factorization of 737 is 11 x 67

Prime Factorization of 978 is 2 x 3 x 163

Prime Factorization of 51 is 3 x 17

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(737, 978) = 720786

GCD(737, 978) = ( 737 x 978 ) / 720786

GCD(737, 978) = 720786 / 720786

GCD(737, 978) = 1

Step2:

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

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

LCM(1, 51) = 51

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

GCD(1, 51) = 51 / 51

GCD(1, 51) = 1

GCD of 737, 978, 51 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 615, 919, 23
• GCD of 164, 541, 94
• GCD of 792, 169, 91
• GCD of 176, 761, 23
• GCD of 138, 541, 16

1. What is the GCD of 737, 978, 51?

GCD of 737, 978, 51 is 1

2. Where do I get the detailed procedure to find GCD of 737, 978, 51?

You can find a detailed procedure to find GCD of 737, 978, 51 on our page.

3. How to find GCD of 737, 978, 51 on a calculator?

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