andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge pull request #513 from kriadmin/patch-5

Browse Source 
Update lcm.md
This commit is contained in:
Angelos Chalaris
2018-01-08 22:27:56 +02:00
committed by GitHub
parent a076ef3765 6d7b4975c3
commit 3122ebc51a
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
snippets/lcm.md
View File

@ -2,7 +2,7 @@
Returns the least common multiple of two or more numbers.
Use the greatest common divisor (GCD) formula and `Math.abs()` to determine the least common multiple.
Use the greatest common divisor (GCD) formula and the fact that `lcm(x,y) = x * y / gcd(x,y)` to determine the least common multiple.
The GCD formula uses recursion.
```js