As far as I know, there isn’t any built-in method for primitives. But something as simple as this should do the trick: public int gcd(int a, int b) { if (b==0) return a; return gcd(b,a%b); } You can also one-line it if you’re into that sort of thing: public int gcd(int a, int b) { … Read more
Since GCD is associative, GCD(a,b,c,d) is the same as GCD(GCD(GCD(a,b),c),d). In this case, Python’s reduce function would be a good candidate for reducing the cases for which len(numbers) > 2 to a simple 2-number comparison. The code would look something like this: if len(numbers) > 2: return reduce(lambda x,y: GCD([x,y]), numbers) Reduce applies the given … Read more
I’ve used Euclid’s algorithm to find the greatest common divisor of two numbers; it can be iterated to obtain the GCD of a larger set of numbers. private static long gcd(long a, long b) { while (b > 0) { long temp = b; b = a % b; // % is remainder a = … Read more