Least common multiple: Difference between revisions

(→‎{{header|D}}: keep gcd separate so it can be reused; also allow bigint to return zero)
Line 186:
if (n == 0) return n;
T r = (m * n) / gcd(m, n);
return (r >=< 0) ? -r : -r;
}
 
Anonymous user