Search results
17 packages found
Fastest Prime Number Calculation logic for nodejs and browser (checks, random generator, prime range generator, primes count generator, summation of primes, factorial of primes)
- Fastest
- Prime
- Number
- Calculation
- fast primes
- fast prime
- fast
- primes
- numbers
- prime numbers
- prime
- get prime
- get primes
- fetch prime
- View more
Test if a number is prime.
Test if a number is composite.
Test if two numbers are coprime.
Fastest Prime Number Calculation logic for browser (checks, random generator, prime range generator, primes count generator, summation of primes, factorial of primes)
- Fastest
- Prime
- Number
- Calculation
- fast primes
- fast prime
- fast
- primes
- numbers
- prime numbers
- prime
- get prime
- get primes
- fetch prime
- View more
Lucas-Lehmer primality test
Test if a value is a prime number.
- stdlib
- stdassert
- assertion
- assert
- utilities
- utility
- utils
- util
- number
- numeric
- integer
- int
- prime
- primality
- View more
Test if a value is a composite number.
- stdlib
- stdassert
- assertion
- assert
- utilities
- utility
- utils
- util
- number
- numeric
- integer
- int
- composite
- prime
- View more
Primality test using fast checks and miller-rabin (all in one)
Implementation of the Miller-Rabin primality test.
Test if a number is a prime number.
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.
A Javascript Implementation of the Lucas-Lehmer Primality Test for Mersenne Primes
is a recursive function to check if a number is prime (and a benchmark to test how slow it is :)
Number theory for integers for JavaScript