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