GCD of 801, 382, 42 Calculator

Given Input numbers are 801, 382, 42

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

Divisors of 801

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

1, 3, 9, 89, 267, 801

Divisors of 382

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

1, 2, 191, 382

Divisors of 42

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

1, 2, 3, 6, 7, 14, 21, 42

Greatest Common Divisior

We found the divisors of 801, 382, 42 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 801, 382, 42 is 1.

Therefore, GCD of numbers 801, 382, 42 is 1

Given Input Data is 801, 382, 42

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

Prime Factorization of 801 is 3 x 3 x 89

Prime Factorization of 382 is 2 x 191

Prime Factorization of 42 is 2 x 3 x 7

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(801, 382) = 305982

GCD(801, 382) = ( 801 x 382 ) / 305982

GCD(801, 382) = 305982 / 305982

GCD(801, 382) = 1

Step2:

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

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

LCM(1, 42) = 42

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

GCD(1, 42) = 42 / 42

GCD(1, 42) = 1

GCD of 801, 382, 42 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 932, 993, 89
• GCD of 143, 697, 27
• GCD of 421, 309, 24
• GCD of 352, 639, 47
• GCD of 604, 490, 81

1. What is the GCD of 801, 382, 42?

GCD of 801, 382, 42 is 1

2. Where do I get the detailed procedure to find GCD of 801, 382, 42?

You can find a detailed procedure to find GCD of 801, 382, 42 on our page.

3. How to find GCD of 801, 382, 42 on a calculator?

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