(untagged)

Fast Greatest Common Divisor (GCD) Algorithm

Mauro Leggieri

0.00/5 (No votes)

18 Feb 2011

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.

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.

License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here