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

Consistent whitespace

Browse Source
This commit is contained in:
Isabelle Viktoria Maciohsek
2020-11-03 21:46:13 +02:00
parent f057d4d95b
commit 81e37d20c0
11 changed files with 16 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
snippets/lcm.md
View File

@ -5,7 +5,7 @@ tags: math,recursion,intermediate
Calculates the least common multiple of two or more numbers.
- 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.
- 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