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