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

Resolves #297

Browse Source
This commit is contained in:
Angelos Chalaris
2017-12-22 10:31:50 +02:00
committed by GitHub
parent bcea44bcd8
commit c4eb961b5c
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
snippets/isPrime.md
View File

@ -2,11 +2,13 @@
Checks if the provided integer is a prime number. Checks if the provided integer is a prime number.
Returns `false` if the provided number has positive divisors other than 1 and itself or if the number itself is less than 2. 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`.
```js ```js
const isPrime = num => { const isPrime = num => {
for (var i = 2; i * i <= num; i++) if (num % i == 0) return false; const boundary = Math.floor(Math.sqrt(num));
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