Primes Packages

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

check if a number is prime

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.

A light-weight command line tool for finding the origins of sequences and querying the OEIS database

Advanced Prime Numbers Functions. All functions that you need. Generate primes and process with prime numbers

Implementation of various prime sieves in javascript with hooks for a sieving callback

get an array of primes between upper and lower bound

JavaScript implementation of the Sieve of Sundaram for finding prime numbers.

The first 100,000 prime numbers as a UMD bundle.

Fast arbitraty-precision integer arithmetic library. Used for large-number calculations including finding large prime numbers, performing modular exponentiation and other arithmetic operations.

Utilities from primes numbers.

Compute p, q, dp, dq, and qi from e, d, and n for private JWKs without these parameters

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

[](LICENSE)

A compact (bitfield) primesieve in JavaScript together with the functions to use it