Search results

27 packages found

Test if a number is prime.

published version 0.3.0, 4 months ago

Maintenance: 33%. Quality: 51%. Popularity: 3%.

Test if a number is composite.

published version 0.3.0, 4 months ago

Maintenance: 33%. Quality: 51%. Popularity: 3%.

Test if two numbers are coprime.

published version 0.2.2, 4 months ago

Maintenance: 33%. Quality: 51%. Popularity: 2%.

Test if a value is a prime number.

published version 0.2.2, 4 months ago

Maintenance: 33%. Quality: 51%. Popularity: 0%.

Test if a value is a composite number.

published version 0.2.2, 4 months ago

Maintenance: 33%. Quality: 51%. Popularity: 0%.

Lucas-Lehmer primality test

published version 4.0.1, a year ago

Maintenance: 20%. Quality: 54%. Popularity: 0%.

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.

published version 1.0.5, 2 years ago

Maintenance: 8%. Quality: 62%. Popularity: 0%.

Find a prime

published version 4.0.2, a year ago

Maintenance: 10%. Quality: 54%. Popularity: 2%.

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

published version 1.0.2, 5 years ago

Maintenance: None. Quality: 61%. Popularity: 3%.

A Javascript Implementation of the Lucas-Lehmer Primality Test for Mersenne Primes

published version 1.0.1, 8 years ago

Maintenance: None. Quality: 64%. Popularity: 0%.

Test if a number is a prime number.

published version 1.0.1, 2 years ago

Maintenance: 8%. Quality: 53%. Popularity: 2%.

Simple prime number and prime factorization package

published version 1.0.1, 6 years ago

Maintenance: None. Quality: 61%. Popularity: 2%.

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

published version 3.0.0, 6 years ago

Maintenance: None. Quality: 61%. Popularity: 2%.

Functional library for precise access to integer sequences such as prime numbers, square numbers, triangle numbers, etc

published version 1.0.4, 6 years ago

Maintenance: None. Quality: 63%. Popularity: 0%.

Fermat's probabilistic primality test

published version 3.0.0, a year ago

Maintenance: 6%. Quality: 54%. Popularity: 2%.

An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.

published version 4.4.1, 2 years ago

Maintenance: 10%. Quality: 51%. Popularity: 0%.

a simple isPrime, next and prev Prime number implementation in Js.

published version 1.0.1, 5 years ago

Maintenance: None. Quality: 61%. Popularity: 0%.

Carmichael numbers

published version 2.0.0, a year ago

Maintenance: 4%. Quality: 54%. Popularity: 2%.

Eratosthenes primality implementation

published version 1.0.0, 6 years ago

Maintenance: None. Quality: 60%. Popularity: 0%.

Primality test using fast checks and miller-rabin (all in one)

published version 1.1.1, 9 years ago

Maintenance: None. Quality: 54%. Popularity: 3%.