Prime Packages

Integer sequences, number types and more

nearestPrime() takes a number and returns the closest prime number

A simple function to find the next prime number.

A simple utility library for common mathematical operations.

Find prime factors.

Arbitrary precision modular arithmetic, cryptographically secure random numbers and strong probable prime generation/testing. It works in modern browsers, Angular, React, Node.js, etc. since it uses the native JS implementation of BigInt

integer factorization using Pollard's rho algorithm with Brent cycle detection, Miller–Rabin primality test

Arbitrary precision modular arithmetic, cryptographically secure random numbers and strong probable prime generation/testing. It works in modern browsers, Angular, React, Node.js, etc. since it uses the native JS implementation of BigInt

A simple package to find the Nth prime number.

a npm package for efficiently validating prime integer numbers

Validate the number is prime or not

用于输出指定正整数上限内所有的质数

Prime number library

generate prime next to entered number

check given number is prime or not

Checks if a number is prime or not

number is prime or not

number is prime or not

An array of first 100000 primes

Prime-number generators, using Sieve of Eratosthenes