The following function returns `true`

if the parameter `n`

is
a prime number:

```
// Return true if n is prime
function isPrime(n)
{
// Check if n is less than 2 => not prime
if (n<2) return false;
// Loop from 2 to square root of n
for (let i = 2; i <= Math.sqrt(n); i++)
// If i is a divisor of n, n is not prime
if (n % i == 0) return false;
return true;
}
```

This function check every divison between 2 and square root of `n`

. If `n`

is
not prime, there is necessarily a divisor in this interval.

- Add icons on your web pages
- CSS color table
- How to detect ad blockers on web sites?
- HTML drop-down list of citizenships.
- How Bézier curves are described in SVG paths
- How to get list of subdirectories in PHP
- How to slugify a string in JavaScript?
- How to slugify a string in PHP?
- How to sort a multidimensional array in PHP?
- In PHP, how to convert a date in French?
- Levenshtein distance in mySQL
- List of supported languages by Prism syntax highlighter
- PHP array of countries and citizenships.
- Sessions or cookies?

Last update : 04/13/2019