🚀 Fast prime counting function library
-
Updated
Dec 17, 2025 - C++
🚀 Fast prime counting function library
A Python wrapper for primecount.
Prime counting of sublinear complexity in Common Lisp.
Reproducible analytic number theory and computational pipeline for the digit product / prime index property: base-10 completeness (17, 73, 24752989) and a framework for searching and classifying solutions in other bases. Used in the proofs of the paper by Aleksandar Slavov and Dimitar Mavrodiev.
Add a description, image, and links to the primecount topic page so that developers can more easily learn about it.
To associate your repository with the primecount topic, visit your repo's landing page and select "manage topics."