Test if a number is prime in constant time, using a cached Sieve of Eratosthenes. This is especially helpful to test many numbers' primality.
$ npm install quick-is-prime
var isPrime = ;
// Simple examples// => true// => false// => true// => false// More challenging examples// => true, takes 1.5 seconds// => true, takes less than a millisecond
This module uses a cached Sieve of Eratosthenes for constant time lookup. A new one will be automatically generated if the number you're testing is larger than the currently cached sieve's upper bound.
For best results, check primes highest to lowest. Or alternatively, if you know what the upper bound will be, just check that first to not be concerned with the order.
To run the test suite, first install the dependencies, then run
$ npm install $ npm test
To test code coverage:
$ npm run cover