|0.1.4||Sep 5, 2022|
|0.1.3||Sep 1, 2022|
|0.1.2||Sep 1, 2022|
|0.1.1||Sep 1, 2022|
#1113 in Math
TNT is a free library that provides a rich set of functions that implement many certificates about Integers. It is carefully designed to be fast while producing correct results. The name stands for TNT Number Theory.
TNT also has a wide variety of tests that check the correctness of the implemented algorithm unlike other proposals.
Here is the list of certificates that TNT provides:
- Primality: whether the input is a prime number.
- Prime Sieves: returns an ordered list of primes below the input.
- Perfect Power Detection: mostly algorithms by Daniel J. Bernstein.
TNT uses some GNU libraries, specifically
GF2X. This crates includes a script that must be run in order to fetch those dependencies: