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

Update least-common-multiple-(LCM).md

Browse Source
This commit is contained in:
Angelos Chalaris
2017-12-17 11:26:53 +02:00
committed by GitHub
parent f280fa631b
commit 137fddef9e
1 changed files with 6 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
snippets/least-common-multiple-(LCM).md
View File

@ -1,11 +1,12 @@
### Least common multiple (LCM) ### Least common multiple (LCM)
Use this lcm formula `lcm(a,b)=|a*b|/gcd(a,b)` for calculating the least common multiple of two numbers. Use the greatest common divisor (GCD) formula and `Math.abs()` to determine the least common multiple.
Makes use of the [GCD snippet](https://github.com/Chalarangelo/30-seconds-of-code#greatest-common-divisor-gcd). The GCD formula uses recursion.
```js ```js
const lcm = (x,y) => Math.abs(x*y)/(gcd(x,y)); const lcm = (x,y) => {
const gcd = (x, y) => !y ? x : gcd(y, x % y); const gcd = (x, y) => !y ? x : gcd(y, x % y);
// lcm(10,5) -> 10 return Math.abs(x*y)/(gcd(x,y));
};
// lcm(12,7) -> 84 // lcm(12,7) -> 84
``` ```