Created By : Jatin Gogia
Reviewed By : Rajasekhar Valipishetty
Last Updated : Apr 06, 2023
Make use of GCD Calculator to determine the Greatest Common Divisor of 958, 448, 567, 309 i.e. 1 largest integer that divides all the numbers equally.
GCD of 958, 448, 567, 309 is 1
GCD(958, 448, 567, 309) = 1
Ex: 10, 15, 20 (or) 24, 48, 96,45 (or) 78902, 89765, 12345
GCD of numbers 958, 448, 567, 309 is 1
GCD(958, 448, 567, 309) = 1
Given Input numbers are 958, 448, 567, 309
To find the GCD of numbers using factoring list out all the divisors of each number
Divisors of 958
List of positive integer divisors of 958 that divides 958 without a remainder.
1, 2, 479, 958
Divisors of 448
List of positive integer divisors of 448 that divides 448 without a remainder.
1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 112, 224, 448
Divisors of 567
List of positive integer divisors of 567 that divides 567 without a remainder.
1, 3, 7, 9, 21, 27, 63, 81, 189, 567
Divisors of 309
List of positive integer divisors of 309 that divides 309 without a remainder.
1, 3, 103, 309
Greatest Common Divisior
We found the divisors of 958, 448, 567, 309 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 958, 448, 567, 309 is 1.
Therefore, GCD of numbers 958, 448, 567, 309 is 1
Given Input Data is 958, 448, 567, 309
Make a list of Prime Factors of all the given numbers initially
Prime Factorization of 958 is 2 x 479
Prime Factorization of 448 is 2 x 2 x 2 x 2 x 2 x 2 x 7
Prime Factorization of 567 is 3 x 3 x 3 x 3 x 7
Prime Factorization of 309 is 3 x 103
The above numbers do not have any common prime factor. So GCD is 1
Step1:
Let's calculate the GCD of first two numbers
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(958, 448) = 214592
GCD(958, 448) = ( 958 x 448 ) / 214592
GCD(958, 448) = 429184 / 214592
GCD(958, 448) = 2
Step2:
Here we consider the GCD from the above i.e. 2 as first number and the next as 567
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(2, 567) = 1134
GCD(2, 567) = ( 2 x 567 ) / 1134
GCD(2, 567) = 1134 / 1134
GCD(2, 567) = 1
Step3:
Here we consider the GCD from the above i.e. 1 as first number and the next as 309
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(1, 309) = 309
GCD(1, 309) = ( 1 x 309 ) / 309
GCD(1, 309) = 309 / 309
GCD(1, 309) = 1
GCD of 958, 448, 567, 309 is 1
Here are some samples of GCD of Numbers calculations.
1. What is the GCD of 958, 448, 567, 309?
GCD of 958, 448, 567, 309 is 1
2. Where do I get the detailed procedure to find GCD of 958, 448, 567, 309?
You can find a detailed procedure to find GCD of 958, 448, 567, 309 on our page.
3. How to find GCD of 958, 448, 567, 309 on a calculator?
You can find the GCD of 958, 448, 567, 309 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.