GCD of 113, 746, 388 Calculator

Given Input numbers are 113, 746, 388

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

Divisors of 113

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

1, 113

Divisors of 746

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

1, 2, 373, 746

Divisors of 388

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

1, 2, 4, 97, 194, 388

Greatest Common Divisior

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

Therefore, GCD of numbers 113, 746, 388 is 1

Given Input Data is 113, 746, 388

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

Prime Factorization of 113 is 113

Prime Factorization of 746 is 2 x 373

Prime Factorization of 388 is 2 x 2 x 97

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(113, 746) = 84298

GCD(113, 746) = ( 113 x 746 ) / 84298

GCD(113, 746) = 84298 / 84298

GCD(113, 746) = 1

Step2:

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

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

LCM(1, 388) = 388

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

GCD(1, 388) = 388 / 388

GCD(1, 388) = 1

GCD of 113, 746, 388 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 436, 876, 313
• GCD of 581, 703, 438
• GCD of 288, 336, 130
• GCD of 904, 722, 312
• GCD of 489, 737, 952

1. What is the GCD of 113, 746, 388?

GCD of 113, 746, 388 is 1

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

You can find a detailed procedure to find GCD of 113, 746, 388 on our page.

3. How to find GCD of 113, 746, 388 on a calculator?

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