Fast Greatest Common Divisor (GCD) Algorithm

Mauro Leggieri

4.00/5 (1 vote)

Feb 18, 2011

CPOL

8728

It is better to do this:public static long LCM(long a, long b){ return (a / GCD(a,b)) * b;}To avoid overflow on big numbers.

public static long LCM(long a, long b)
{
    return (a / GCD(a,b)) * b;
}