The GCD of three or more numbers equals the product of the prime factors common to all the numbers, but it can also be calculated by repeatedly taking the GCDs of pairs of numbers.
gcd(a, b, c) = gcd(a, gcd(b, c))
= gcd(gcd(a, b), c)
= gcd(gcd(a, c), b)
Java
// Java program to find GCD of two or// more numbersÂ
public class GCD {    // Function to return gcd of a and b    static int gcd(int a, int b)    {        if (a == 0)            return b;        return gcd(b % a, a);    }Â
    // Function to find gcd of array of    // numbers    static int findGCD(int arr[], int n)    {        int result = arr[0];        for (int i = 1; i < n; i++)            result = gcd(arr[i], result);Â
        return result;    }Â
    public static void main(String[] args)    {        int arr[] = { 2, 4, 6, 8, 16 };        int n = arr.length;        System.out.println(findGCD(arr, n));    }}Â
// This code is contributed by Saket Kumar |
Output:
2
Time complexity: O(n)
Space complexity: O(1)
Please refer complete article on GCD of more than two (or array) numbers for more details!
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
