GCD of 145, 703, 371 Calculator

Given Input numbers are 145, 703, 371

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

Divisors of 145

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

1, 5, 29, 145

Divisors of 703

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

1, 19, 37, 703

Divisors of 371

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

1, 7, 53, 371

Greatest Common Divisior

We found the divisors of 145, 703, 371 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 145, 703, 371 is 1.

Therefore, GCD of numbers 145, 703, 371 is 1

Given Input Data is 145, 703, 371

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

Prime Factorization of 145 is 5 x 29

Prime Factorization of 703 is 19 x 37

Prime Factorization of 371 is 7 x 53

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(145, 703) = 101935

GCD(145, 703) = ( 145 x 703 ) / 101935

GCD(145, 703) = 101935 / 101935

GCD(145, 703) = 1

Step2:

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

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

LCM(1, 371) = 371

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

GCD(1, 371) = 371 / 371

GCD(1, 371) = 1

GCD of 145, 703, 371 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 392, 829, 474
• GCD of 762, 173, 943
• GCD of 610, 698, 147
• GCD of 117, 611, 443
• GCD of 611, 442, 922

1. What is the GCD of 145, 703, 371?

GCD of 145, 703, 371 is 1

2. Where do I get the detailed procedure to find GCD of 145, 703, 371?

You can find a detailed procedure to find GCD of 145, 703, 371 on our page.

3. How to find GCD of 145, 703, 371 on a calculator?

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