From 43ba1e0bccb05fa1564b9779f0c779a81f8cd81a Mon Sep 17 00:00:00 2001
From: Travis CI <travis@travis-ci.org>
Date: Fri, 29 Dec 2017 14:56:07 +0000
Subject: [PATCH] Travis build: 626

---
 README.md       | 7 +++----
 docs/index.html | 7 +++----
 2 files changed, 6 insertions(+), 8 deletions(-)

diff --git a/README.md b/README.md
index 1e379163e..112aa68c6 100644
--- a/README.md
+++ b/README.md
@@ -2546,17 +2546,16 @@ isPrime(12); // false
 
 ### lcm
 
-Returns the least common multiple of two or numbers/arrays.
+Returns the least common multiple of two or more numbers/arrays.
 
 Use the greatest common divisor (GCD) formula and `Math.abs()` to determine the least common multiple.
 The GCD formula uses recursion.
 
 ```js
 const lcm = (...arr) => {
-  let data = [].concat(...arr);
   const gcd = (x, y) => (!y ? x : gcd(y, x % y));
-  const helperLcm = (x, y) => x * y / gcd(x, y);
-  return arr.reduce((a, b) => helperLcm(a, b));
+  const _lcm = (x, y) => x * y / gcd(x, y);
+  return [].concat(...arr).reduce((a, b) => _lcm(a, b));
 };
 ```
 
diff --git a/docs/index.html b/docs/index.html
index f2133ab4f..a45295e6e 100644
--- a/docs/index.html
+++ b/docs/index.html
@@ -482,11 +482,10 @@ isArmstrongNumber(56); // false
 };
 </code></pre><pre><code class="language-js">isPrime(11); // true
 isPrime(12); // false
-</code></pre></div></div><br/><div class="card fluid"><div class="section double-padded"><h3 id="lcm">lcm</h3></div><div class="section double-padded"><p>Returns the least common multiple of two or numbers/arrays.</p><p>Use the greatest common divisor (GCD) formula and <code>Math.abs()</code> to determine the least common multiple. The GCD formula uses recursion.</p><pre><code class="language-js">const lcm = (...arr) =&gt; {
-  let data = [].concat(...arr);
+</code></pre></div></div><br/><div class="card fluid"><div class="section double-padded"><h3 id="lcm">lcm</h3></div><div class="section double-padded"><p>Returns the least common multiple of two or more numbers/arrays.</p><p>Use the greatest common divisor (GCD) formula and <code>Math.abs()</code> to determine the least common multiple. The GCD formula uses recursion.</p><pre><code class="language-js">const lcm = (...arr) =&gt; {
   const gcd = (x, y) =&gt; (!y ? x : gcd(y, x % y));
-  const helperLcm = (x, y) =&gt; x * y / gcd(x, y);
-  return arr.reduce((a, b) =&gt; helperLcm(a, b));
+  const _lcm = (x, y) =&gt; x * y / gcd(x, y);
+  return [].concat(...arr).reduce((a, b) =&gt; _lcm(a, b));
 };
 </code></pre><pre><code class="language-js">lcm(12, 7); // 84
 lcm([1, 3, 4], 5); // 60