Search results
262 packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
module with functions relating to the prime factors of a positive integer
Find prime factors.
Miller Rabin algorithm for 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
get prime factors of a number
Quickly get a number's prime factors, using a cached Sieve of Eratosthenes
Beta prime distribution cumulative distribution function (CDF).
- stdlib
- stdmath
- statistics
- stats
- distribution
- dist
- probability
- prob
- cdf
- cumulative
- cumulative distribution
- distribution function
- beta
- prime
- View more
elliptic curves implementations in wasm
Assorted common math functions & utilities
- animation
- bezier
- cubic
- easing
- hermite
- interpolation
- interval
- math
- prime
- quadratic
- smoothmax
- smoothstep
- solver
- trigonometry
Do math on arrays: find divisors or factors of a number, sum or multiply an array, and much more!
Beta prime distributed pseudorandom numbers.
Minimal implementation of older cryptography algorithms: RSA, DSA, DH
find prime factors of a number
Generate a cryptographically-random probable prime number that passes the Miller-Rabin test with the given number of bits of entropy.
Implementation of the Miller-Rabin primality test.
Quadratic Sieve integer factorization method for JavaScript bigints
Generate a Sieve of Eratosthenes with constant time lookup
Test if a number is prime in constant time, using a cached Sieve of Eratosthenes.
Sieve of Eratosthenes implementation.
prime dom library