lcm version 0.1

*Find the least common multiple (a.k.a. lowest common multiple, smallest common multiple or lowest common denominator) of two numbers.*

Run

Source (PHP)

```
function lcm ($a, $b)
```

{

return abs($a*$b)/gcd_euclid($a, $b);

}

Tags

least, common, multiple, euclid, math, lcm, lcd

Tools & Information

Rate this algorithm: no ratings yet

Flag: 0 Buggy | 0 Dangerous | 0 Slow | 0 Vandalized

Average run time: 0.000171309 seconds