From 656f97afb60f39eb66bd01a9ca3b321cd96e81f4 Mon Sep 17 00:00:00 2001
From: David Wu <david10608@gmail.com>
Date: Sat, 16 Dec 2017 20:55:39 +0100
Subject: [PATCH] Create least-common-multiple-(LCM).md

---
 snippets/least-common-multiple-(LCM).md | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 snippets/least-common-multiple-(LCM).md

diff --git a/snippets/least-common-multiple-(LCM).md b/snippets/least-common-multiple-(LCM).md
new file mode 100644
index 000000000..1696114f2
--- /dev/null
+++ b/snippets/least-common-multiple-(LCM).md
@@ -0,0 +1,11 @@
+### 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.
+Makes use of the [GCD snippet](https://github.com/Chalarangelo/30-seconds-of-code#greatest-common-divisor-gcd).
+
+```js
+const lcm = (x,y) => Math.abs(x*y)/(gcd(x,y));
+const gcd = (x, y) => !y ? x : gcd(y, x % y);
+// lcm(10,5) -> 10
+// lcm(12,7) -> 84
+```