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

Travis build: 93

Browse Source
This commit is contained in:
Pl4gue
2017-12-22 08:36:56 +00:00
parent 246d1119ac
commit f614b30efb
2 changed files with 4 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
README.md
View File

@ -1381,13 +1381,11 @@ const isEven = num => num % 2 === 0;
Checks if the provided integer is a prime number. Checks if the provided integer is a prime number.
Check numbers from `2` to the square root of the given number. Returns `false` if the provided number has positive divisors other than 1 and itself or if the number itself is less than 2.
Return `false` if any of them divides the given number, else return `true`, unless the number is less than `2`.
```js ```js
const isPrime = num => { const isPrime = num => {
const boundary = Math.floor(Math.sqrt(num)); for (var i = 2; i * i <= num; i++) if (num % i == 0) return false;
for (var i = 2; i * i <= boundary; i++) if (num % i == 0) return false;
return num >= 2; return num >= 2;
}; };
// isPrime(11) -> true // isPrime(11) -> true

6
docs/index.html
View File

@ -866,11 +866,9 @@ Returns <code>true</code> if the number is even, <code>false</code> if the numbe
</code></pre> </code></pre>
</div></div><br/><div class="card fluid"><div class="section double-padded"><h3 id="isprime">isPrime</h3></div><div class="section double-padded"> </div></div><br/><div class="card fluid"><div class="section double-padded"><h3 id="isprime">isPrime</h3></div><div class="section double-padded">
<p>Checks if the provided integer is a prime number.</p> <p>Checks if the provided integer is a prime number.</p>
<p>Check numbers from <code>2</code> to the square root of the given number. <p>Returns <code>false</code> if the provided number has positive divisors other than 1 and itself or if the number itself is less than 2.</p>
Return <code>false</code> if any of them divides the given number, else return <code>true</code>, unless the number is less than <code>2</code>.</p>
<pre><code class="language-js">const isPrime = num =&gt; { <pre><code class="language-js">const isPrime = num =&gt; {
const boundary = Math.floor(Math.sqrt(num)); for (var i = 2; i * i &lt;= num; i++) if (num % i == 0) return false;
for (var i = 2; i * i &lt;= boundary; i++) if (num % i == 0) return false;
return num &gt;= 2; return num &gt;= 2;
}; };
// isPrime(11) -&gt; true // isPrime(11) -&gt; true