Online GCD Calculator is useful to find the GCD of 138, 773, 403 quickly. Get the easiest ways to solve the greatest common divisor of 138, 773, 403 i.e 1 in different methods as follows.
Given Input numbers are 138, 773, 403
In the factoring method, we have to find the divisors of all numbers
Divisors of 138 :
The positive integer divisors of 138 that completely divides 138 are.
1, 2, 3, 6, 23, 46, 69, 138
Divisors of 773 :
The positive integer divisors of 773 that completely divides 773 are.
1, 773
Divisors of 403 :
The positive integer divisors of 403 that completely divides 403 are.
1, 13, 31, 403
GCD of numbers is the greatest common divisor
So, the GCD (138, 773, 403) = 1.
Given numbers are 138, 773, 403
The list of prime factors of all numbers are
Prime factors of 138 are 2 x 3 x 23
Prime factors of 773 are 773
Prime factors of 403 are 13 x 31
The above numbers do not have any common prime factor. So GCD is 1
Given numbers are 138, 773, 403
GCD of 2 numbers formula is GCD(a, b) = ( a x b) / LCM(a, b)
Apply this formula for all numbers.
Step1:
LCM(138, 773) = 106674
GCD(138, 773) = ( 138 x 773 ) / 106674
= 138 / 773
= 138
Step2:
LCM(1, 403) = 403
GCD(1, 403) = ( 1 x 403 ) / 403
= 1 / 403
= 1
So, Greatest Common Divisor of 138, 773, 403 is 1
Here are some samples of GCD of Numbers calculations.
Given numbers are 138, 773, 403
The greatest common divisor of numbers 138, 773, 403 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 138, 773, 403 is 1.
1. What is the GCD of 138, 773, 403?
GCD of given numbers 138, 773, 403 is 1
2. How to calculate the greatest common divisor of 138, 773, 403?
We can find the highest common divisor of 138, 773, 403 easily using the prime factorization method. Just list the prime factors of all numbers and pick the highest common factor which is the GCD of 138, 773, 403 i.e 1.
3. How can I use the GCD of 138, 773, 403Calculator?
Out the numbers 138, 773, 403 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.