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