Checks if the provided integer is a prime number.
2
to the square root of the given number.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 (let i = 2; i <= boundary; i++) if (num % i === 0) return false;
return num >= 2;
};
isPrime(11); // true
JavaScript, Math
Implements the Luhn Algorithm, used to validate a variety of identification numbers.
JavaScript, Math
Generates primes up to a given number, using the Sieve of Eratosthenes.
JavaScript, Math
Creates an array of numbers in the arithmetic progression, starting with the given positive integer and up to the specified limit.