Primality Packages

is a recursive function to check if a number is prime (and a benchmark to test how slow it is :)

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)

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.

Check if the given number is a mersenne prime or not.

A tiny (128B) utility to check if a value is a prime number

Simple prime number and prime factorization package

Primality test (naive approach)

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.

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.

Eratosthenes primality implementation

Test if a value is a composite number.

Test if a number is composite.