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