Search results
251 packages found
Create an iterator which generates a sequence of composite numbers.
- stdlib
- stdmath
- mathematics
- math
- composites
- composite
- prime
- integer
- int
- number
- sequence
- iterator
- iterate
- iteration
Create an iterator for generating pseudorandom numbers drawn from a beta prime distribution.
Lucas-Lehmer primality test
Generate sequential primes through a generator
Streaming number generator for e, pi, and primes
small package to check if given number is a prime number.
Generate a random prime number
A module to determine whether the numeric is prime.
creates a space isomorphic to Zp: the cyclic ring of order p, where p is prime
Returns boolean of if provided number is prime.
Create a readable stream for generating pseudorandom numbers drawn from a beta prime distribution.
get an array of primes between upper and lower bound
List of coprime numbers between A and B (inclusive) for a given C.
Check if the given number is a mersenne prime or not.
O(1) Algorithm to check if number is not prime that works in 95%+ cases.
to check whether a number is prime or not
The first 100,000 prime numbers.
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