Search results
70 packages found
JavaScript library for efficient prime number detection and arithmetic, with customizable algorithms for large numbers.
The first 100,000 prime numbers.
A very useless math package for your complex javascript projects
- javascript
- typescript
- math
- maths
- prime
- numbers
- ratios
- rate
- distance
- factorization
- factors
- simple
- area
- volume
- View more
The first 100,000 prime numbers.
Test if two numbers are coprime.
Create an iterator which generates a sequence of prime numbers.
Create an iterator which generates a sequence of composite numbers.
- stdlib
- stdmath
- mathematics
- math
- composites
- composite
- prime
- integer
- int
- number
- sequence
- iterator
- iterate
- iteration
Beta prime distributed pseudorandom numbers.
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
Fastest algorithm ever created to detect if a number is prime in O(1), that works in 95%+ cases for numbers in the 32-bit int range
Create a readable stream for generating pseudorandom numbers drawn from a beta prime distribution.
Create an iterator for generating pseudorandom numbers drawn from a beta prime distribution.
Create a readable stream for generating pseudorandom numbers drawn from a beta prime distribution.
A typescript implementation of the Linear-Sieve algorithm for prime numbers.
A package to compute and check for prime numbers within a specified range.
a npm package for efficiently validating prime integer numbers
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
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
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
An NPM package to find all prime number within a certain integer limit