Primality Test crate
`primal` puts raw power into prime numbers. This crates includes: optimised prime sieves, checking for primality, enumerating primes, factorising numbers, and state-of-the-art estimation of upper and lower bounds for π(n) (the number of primes below n) and p_k (the k-th prime).
An interface to primal using crossbeam's channels. This allows the worker thread to stop once the receiver is dropped, for example.
An interface to primal using tokio's streams. This allows the worker to stop once the receiver is dropped, for example.
Linear programming library that provides primal and dual simplex solvers.
Implementation of primality tests for multi-precision numbers using crypto-bigint
A simple sieve of Eratosthenes designed for testing faster sieves. You probably want `primal-sieve`, or even just `primal` itself.
Check if a number is prime
red_primality provides zero-setup primality testing and factoring for all u64
Implementation of primality tests for multi-precision numbers using crypto-bigint
A library for primality testing algorithms with benchmarking
ne plus ultra primality testing for machine-sized integers
Type-checked serializers for your Ruby objects
JSON API support for the Primalize gem
test primality
An Uber-fast primality testing library.
An Uber-fast primality testing library.
imple gem for generating primal table mutifications.
Ruby gem for accessing Primal Data web services
A number theory library written in pure Ruby. Provides methods for primality test, factoring integers, and more.