Search results
27 packages found
Implementation of the Miller-Rabin primality test.
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
Functional library for precise access to integer sequences such as prime numbers, square numbers, triangle numbers, etc
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
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.
Simple prime number and prime factorization package
Test if a number is prime.
Test if a number is composite.
Primality test using fast checks and miller-rabin (all in one)
Test if two numbers are coprime.
Lucas-Lehmer primality test
Returns boolean of if provided number is prime.
Check if the given number is a mersenne prime or not.
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
is a recursive function to check if a number is prime (and a benchmark to test how slow it is :)
A tiny (128B) utility to check if a value is a prime number