Search results
27 packages found
Test if a number is prime.
Test if a number is composite.
Test if two numbers are coprime.
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
Lucas-Lehmer primality test
Returns true or false depending on the number's parity (odd/even) and primality (prime/composite); Also checks if integer does not exceed the JavaScript MAXIMUM_SAFE_INTEGER.
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
is a recursive function to check if a number is prime (and a benchmark to test how slow it is :)
A Javascript Implementation of the Lucas-Lehmer Primality Test for Mersenne Primes
A tiny (128B) utility to check if a value is a prime number
Functional library for precise access to integer sequences such as prime numbers, square numbers, triangle numbers, etc
Simple prime number and prime factorization package
Test if a number is a prime number.
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
a simple isPrime, next and prev Prime number implementation in Js.
Number theory for integers for JavaScript