what is the fastest way to compute the greatest common divisor of n numbers?
You should use Lehmer's GCD algorithm.
1.4m articles
1.4m replys
5 comments
57.0k users