GCD of 769, 402, 331 Calculator

Given Input numbers are 769, 402, 331

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

Divisors of 769

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

1, 769

Divisors of 402

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

1, 2, 3, 6, 67, 134, 201, 402

Divisors of 331

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

1, 331

Greatest Common Divisior

We found the divisors of 769, 402, 331 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 769, 402, 331 is 1.

Therefore, GCD of numbers 769, 402, 331 is 1

Given Input Data is 769, 402, 331

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

Prime Factorization of 769 is 769

Prime Factorization of 402 is 2 x 3 x 67

Prime Factorization of 331 is 331

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(769, 402) = 309138

GCD(769, 402) = ( 769 x 402 ) / 309138

GCD(769, 402) = 309138 / 309138

GCD(769, 402) = 1

Step2:

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

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

LCM(1, 331) = 331

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

GCD(1, 331) = 331 / 331

GCD(1, 331) = 1

GCD of 769, 402, 331 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 358, 271, 148
• GCD of 934, 798, 582
• GCD of 622, 914, 851
• GCD of 645, 196, 235
• GCD of 770, 404, 270

1. What is the GCD of 769, 402, 331?

GCD of 769, 402, 331 is 1

2. Where do I get the detailed procedure to find GCD of 769, 402, 331?

You can find a detailed procedure to find GCD of 769, 402, 331 on our page.

3. How to find GCD of 769, 402, 331 on a calculator?

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