Primecount is a command-line program and C++ library that counts the primes below an integer x<=10**31 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 world records e.g. pi(10^27) (http://www.mersenneforum.org/showthread.php?t=20473) and nth_prime(10^24) (https://oeis.org/A006988).
Updates may require up to 24 hours to propagate to mirrors. If the following command doesn't work, please retry later:
sudo dnf install --refresh --advisory=FEDORA-2019-603c8cdce9 \*Please login to add feedback.
This update has been submitted for testing by jjames.
This update's test gating status has been changed to 'waiting'.
This update's test gating status has been changed to 'ignored'.
This update has been pushed to testing.
This update can be pushed to stable now if the maintainer wishes
This update has been submitted for stable by bodhi.
This update has been pushed to stable.