rpms/primecount
4
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
The primecount package
76 commits 15 branches 0 tags 96 KiB
Find a file
Exact
Kim Walisch 0f141465c4 Update to 8.0-7
2025-12-17 19:34:43 +01:00
.fmf set up ci 2024-07-16 08:45:52 -07:00
plans set up ci 2024-07-16 08:45:52 -07:00
tests minor cleanup 2024-10-04 20:30:10 -07:00
.gitignore Update to latest primecount-7.10 release 2024-01-11 18:23:45 +01:00
gating.yaml set up ci 2024-07-16 08:45:52 -07:00
primecount.spec Update to 8.0-7 2025-12-17 19:34:43 +01:00
README.md Version 7.2. 2021-12-12 12:26:37 -07:00
sources Update to 8.0-5 2025-12-16 19:59:47 +01:00

README.md

primecount

Primecount is a command-line program and C/C++ library that counts the primes below an integer x ≤ 1031 using highly optimized implementations of the combinatorial prime counting algorithms.

Primecount includes implementations of all important combinatorial prime counting algorithms known up to this date all of which have been parallelized using OpenMP. Primecount contains the first ever open source implementations of the Deleglise-Rivat algorithm and Xavier Gourdon's algorithm (that works). Primecount also features a novel load balancer that is shared amongst all implementations and that scales up to hundreds of CPU cores. Primecount has already been used to compute several prime counting function world records.