GCD of 329, 766, 113 Calculator

Given Input numbers are 329, 766, 113

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

Divisors of 329

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

1, 7, 47, 329

Divisors of 766

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

1, 2, 383, 766

Divisors of 113

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

1, 113

Greatest Common Divisior

We found the divisors of 329, 766, 113 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 329, 766, 113 is 1.

Therefore, GCD of numbers 329, 766, 113 is 1

Given Input Data is 329, 766, 113

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

Prime Factorization of 329 is 7 x 47

Prime Factorization of 766 is 2 x 383

Prime Factorization of 113 is 113

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(329, 766) = 252014

GCD(329, 766) = ( 329 x 766 ) / 252014

GCD(329, 766) = 252014 / 252014

GCD(329, 766) = 1

Step2:

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

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

LCM(1, 113) = 113

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

GCD(1, 113) = 113 / 113

GCD(1, 113) = 1

GCD of 329, 766, 113 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 826, 160, 611
• GCD of 260, 257, 714
• GCD of 634, 820, 837
• GCD of 622, 706, 734
• GCD of 638, 547, 373

1. What is the GCD of 329, 766, 113?

GCD of 329, 766, 113 is 1

2. Where do I get the detailed procedure to find GCD of 329, 766, 113?

You can find a detailed procedure to find GCD of 329, 766, 113 on our page.

3. How to find GCD of 329, 766, 113 on a calculator?

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