@alexander-nyberg/prime
find out if a number is prime or not
find out if a number is prime or not
Common typescript ready prototypes available in both CommonJS and ECMAScript
module with functions relating to the prime factors of a positive integer
is a recursive function to check if a number is prime (and a benchmark to test how slow it is :)
Get Primes in milliseconds. Pre-calculated collections of prime numbers, natural numbers with distinguished primes and methods to retrieve them.
get the primes numbers using sieve of eratosthene
Get Primes in milliseconds. Pre-calculated collections of prime numbers, natural numbers with distinguished primes and methods to retrieve them.
Nprime, a simple and fast naive module for testing/calculating primes on the fly.
get an array of primes between upper and lower bound
Implementation of various prime sieves in javascript with hooks for a sieving callback
Advanced Prime Numbers Functions. All functions that you need. Generate primes and process with prime numbers
A light-weight command line tool for finding the origins of sequences and querying the OEIS database
JavaScript implementation of the Sieve of Sundaram for finding prime numbers.
The first 100,000 prime numbers as a UMD bundle.
Utilities from primes numbers.
Fast arbitraty-precision integer arithmetic library. Used for large-number calculations including finding large prime numbers, performing modular exponentiation and other arithmetic operations.
Functional library for precise access to integer sequences such as prime numbers, square numbers, triangle numbers, etc
Compute p, q, dp, dq, and qi from e, d, and n for private JWKs without these parameters
A node module to deal with prime related stuff.
A compact (bitfield) primesieve in JavaScript together with the functions to use it