prime-number
check if a number is prime
check if a number is prime
Carmichael numbers
Test if a number is prime
A Javascript Implementation of the Lucas-Lehmer Primality Test for Mersenne Primes
Lucas-Lehmer primality test
Fermat's probabilistic primality test
Find a prime
Primality test using fast checks and miller-rabin (all in one)
Check if the given number is a mersenne prime or not.
Functional library for precise access to integer sequences such as prime numbers, square numbers, triangle numbers, etc
Returns boolean of if provided number is prime.
Simple prime number and prime factorization package
A tiny (128B) utility to check if a value is a prime number
Primality test (naive approach)
Eratosthenes primality implementation
Number theory for integers for JavaScript
Returns true or false depending on the number's parity (odd/even) and primality (prime/composite); Also checks if integer does not exceed the JavaScript MAXIMUM_SAFE_INTEGER.
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.
Test if a number is a prime number.
Test if a number is composite.