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