GCD of 761, 489, 142 Calculator

Given Input numbers are 761, 489, 142

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

Divisors of 761

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

1, 761

Divisors of 489

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

1, 3, 163, 489

Divisors of 142

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

1, 2, 71, 142

Greatest Common Divisior

We found the divisors of 761, 489, 142 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 761, 489, 142 is 1.

Therefore, GCD of numbers 761, 489, 142 is 1

Given Input Data is 761, 489, 142

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

Prime Factorization of 761 is 761

Prime Factorization of 489 is 3 x 163

Prime Factorization of 142 is 2 x 71

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(761, 489) = 372129

GCD(761, 489) = ( 761 x 489 ) / 372129

GCD(761, 489) = 372129 / 372129

GCD(761, 489) = 1

Step2:

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

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

LCM(1, 142) = 142

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

GCD(1, 142) = 142 / 142

GCD(1, 142) = 1

GCD of 761, 489, 142 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 445, 245, 493
• GCD of 255, 580, 589
• GCD of 440, 869, 250
• GCD of 394, 161, 158
• GCD of 594, 805, 559

1. What is the GCD of 761, 489, 142?

GCD of 761, 489, 142 is 1

2. Where do I get the detailed procedure to find GCD of 761, 489, 142?

You can find a detailed procedure to find GCD of 761, 489, 142 on our page.

3. How to find GCD of 761, 489, 142 on a calculator?

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