From 6d7b4975c3320b1344e4d245463ed11776961ade Mon Sep 17 00:00:00 2001
From: Rohit Tanwar <31792358+kriadmin@users.noreply.github.com>
Date: Tue, 9 Jan 2018 01:34:51 +0530
Subject: [PATCH] Update lcm.md

---
 snippets/lcm.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/snippets/lcm.md b/snippets/lcm.md
index cbd86c264..74f346af3 100644
--- a/snippets/lcm.md
+++ b/snippets/lcm.md
@@ -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