Search code examples
algorithmmathgreatest-common-divisor

what is the fastest way to find the gcd of n numbers?

what is the fastest way to compute the greatest common divisor of n numbers?

Solution

  • You should use Lehmer's GCD algorithm.