You may want to look at the outputs first.
divisors-out.txt is the output of divisors-demo.cc.
List all divisors of an integer
The demo uses the functions from
divisors.h (fxt/src/mod/divisors.h)
eratosthenes-out.txt is the output of eratosthenes-demo.cc.
Sieve of Eratosthenes.
The demo uses the functions from
bitarray.h (fxt/src/ds/bitarray.h)
isqrt.h (fxt/src/mod/isqrt.h)
fftprimes-out.txt is the output of fftprimes-demo.cc.
Find "FFT primes", primes of the form p==y * 2^x + 1.
The demo uses the functions from
primes.h (fxt/src/mod/primes.h)
factor.h (fxt/src/mod/factor.h)
kronecker-out.txt is the output of kronecker-demo.cc.
Kronecker symbol.
The demo uses the functions from
kronecker.cc (fxt/src/mod/kronecker.cc)
mod-residues-out.txt is the output of mod-residues-demo.cc.
Find moduli where all quadratic (or higher) residues are non-prime.
The demo uses the functions from
primes.h (fxt/src/mod/primes.h)
modarith.h (fxt/src/mod/modarith.h)
modarithtables-out.txt is the output of modarithtables-demo.cc.
Addition-, multiplication- and power tables with modular arithmetic.
The demo uses the functions from
mod.h (fxt/src/mod/mod.h)
modinfo-out.txt is the output of modinfo-demo.cc.
Demo of mod_init(): properties of (Z/mZ)*
The demo uses the functions from
mod.h (fxt/src/mod/mod.h)
modsincos-out.txt is the output of modsincos-demo.cc.
Demo of cosine/sine modulo p.
The demo uses the functions from
mod.h (fxt/src/mod/mod.h)
rabinmiller-out.txt is the output of rabinmiller-demo.cc.
Find composites that are strong pseudoprimes to more than one base.
The demo uses the functions from
primes.h (fxt/src/mod/primes.h)
rabinmiller.cc (fxt/src/mod/rabinmiller.cc)