Online GCD Calculator is useful to find the GCD of 279, 167, 92 quickly. Get the easiest ways to solve the greatest common divisor of 279, 167, 92 i.e 1 in different methods as follows.
Given Input numbers are 279, 167, 92
In the factoring method, we have to find the divisors of all numbers
Divisors of 279 :
The positive integer divisors of 279 that completely divides 279 are.
1, 3, 9, 31, 93, 279
Divisors of 167 :
The positive integer divisors of 167 that completely divides 167 are.
1, 167
Divisors of 92 :
The positive integer divisors of 92 that completely divides 92 are.
1, 2, 4, 23, 46, 92
GCD of numbers is the greatest common divisor
So, the GCD (279, 167, 92) = 1.
Given numbers are 279, 167, 92
The list of prime factors of all numbers are
Prime factors of 279 are 3 x 3 x 31
Prime factors of 167 are 167
Prime factors of 92 are 2 x 2 x 23
The above numbers do not have any common prime factor. So GCD is 1
Given numbers are 279, 167, 92
GCD of 2 numbers formula is GCD(a, b) = ( a x b) / LCM(a, b)
Apply this formula for all numbers.
Step1:
LCM(279, 167) = 46593
GCD(279, 167) = ( 279 x 167 ) / 46593
= 279 / 167
= 279
Step2:
LCM(1, 92) = 92
GCD(1, 92) = ( 1 x 92 ) / 92
= 1 / 92
= 1
So, Greatest Common Divisor of 279, 167, 92 is 1
Here are some samples of GCD of Numbers calculations.
Given numbers are 279, 167, 92
The greatest common divisor of numbers 279, 167, 92 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 279, 167, 92 is 1.
1. What is the GCD of 279, 167, 92?
GCD of given numbers 279, 167, 92 is 1
2. How to calculate the greatest common divisor of 279, 167, 92?
We can find the highest common divisor of 279, 167, 92 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 279, 167, 92 i.e 1.
3. How can I use the GCD of 279, 167, 92Calculator?
Out the numbers 279, 167, 92 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.