From a0abba7e42aec2a5aca81b9ebedd8e73d4228bca Mon Sep 17 00:00:00 2001 From: Travis CI Date: Sun, 31 Dec 2017 11:30:24 +0000 Subject: [PATCH] Travis build: 700 [ci skip] --- README.md | 2 +- docs/index.html | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 23d3c641d..9cdeb42e2 100644 --- a/README.md +++ b/README.md @@ -2643,7 +2643,7 @@ Return `false` if any of them divides the given number, else return `true`, unle ```js const isPrime = num => { const boundary = Math.floor(Math.sqrt(num)); - for (var i = 2; i * i <= boundary; i++) if (num % i == 0) return false; + for (var i = 2; i <= boundary; i++) if (num % i == 0) return false; return num >= 2; }; ``` diff --git a/docs/index.html b/docs/index.html index 009792b77..2acf4f2bb 100644 --- a/docs/index.html +++ b/docs/index.html @@ -518,7 +518,7 @@ isArmstrongNumber(56); // false 
isEven(3); // false

isPrime

Checks if the provided integer is a prime number.

Check numbers from 2 to the square root of the given number. Return false if any of them divides the given number, else return true, unless the number is less than 2.

const isPrime = num => {
   const boundary = Math.floor(Math.sqrt(num));
-  for (var i = 2; i * i <= boundary; i++) if (num % i == 0) return false;
+  for (var i = 2; i <= boundary; i++) if (num % i == 0) return false;
   return num >= 2;
 };
 
isPrime(11); // true