5 unstable releases
| 0.3.0 | Mar 19, 2024 |
|---|---|
| 0.2.1 | Mar 8, 2024 |
| 0.2.0 | Mar 7, 2024 |
| 0.1.1 | Mar 1, 2024 |
| 0.1.0 | Jan 3, 2024 |
#783 in Math
46 downloads per month
19KB
361 lines
Document
Provide a method to determine whether an unsigned integer is a prime number through the IsPrime Trait.
In the current implementation, this crate uses the Miller-Rabin primality test.
The Miller-Rabin primality test is known to have witnesses that can conclusively determine unsigned integers of at most 64 bits.
In this crate, the following information is used to select the witnesses.
Deterministic variants of the Miller-Rabin primality test
LICENSE
This crate is provided under MIT License.
Please read LICENSE.
lib.rs:
Provide a method to determine whether an unsigned integer is a prime number through the IsPrime Trait.
In the current implementation, this crate uses the Miller-Rabin primality test.
The Miller-Rabin primality test is known to have witnesses that can conclusively determine unsigned integers of at most 64 bits.
In this crate, the following information is used to select the witnesses.