GCD of 293, 982, 361 Calculator

Given Input numbers are 293, 982, 361

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

Divisors of 293

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

1, 293

Divisors of 982

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

1, 2, 491, 982

Divisors of 361

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

1, 19, 361

Greatest Common Divisior

We found the divisors of 293, 982, 361 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 293, 982, 361 is 1.

Therefore, GCD of numbers 293, 982, 361 is 1

Given Input Data is 293, 982, 361

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

Prime Factorization of 293 is 293

Prime Factorization of 982 is 2 x 491

Prime Factorization of 361 is 19 x 19

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(293, 982) = 287726

GCD(293, 982) = ( 293 x 982 ) / 287726

GCD(293, 982) = 287726 / 287726

GCD(293, 982) = 1

Step2:

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

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

LCM(1, 361) = 361

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

GCD(1, 361) = 361 / 361

GCD(1, 361) = 1

GCD of 293, 982, 361 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 395, 748, 844
• GCD of 493, 845, 389
• GCD of 970, 128, 264
• GCD of 590, 976, 673
• GCD of 993, 327, 618

1. What is the GCD of 293, 982, 361?

GCD of 293, 982, 361 is 1

2. Where do I get the detailed procedure to find GCD of 293, 982, 361?

You can find a detailed procedure to find GCD of 293, 982, 361 on our page.

3. How to find GCD of 293, 982, 361 on a calculator?

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