Count the number of primes
primecount is a command-line program and C/C++ library that counts the primes below an integer x ≤ 10^31 using highly optimized implementations of the combinatorial prime counting algorithms.
- Developed at devel:libraries:c_c++
- Sources inherited from project openSUSE:Factory
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Backports:SLE-15-SP4:FactoryCandidates/primecount && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| primecount-7.1.tar.gz | 0000331976 324 KB | |
| primecount.changes | 0000002509 2.45 KB | |
| primecount.spec | 0000002605 2.54 KB |
Revision 5 (latest revision is 17)
Richard Brown (RBrownSUSE)
accepted
request 912453
from
Kim Walisch (walki)
(revision 5)
- Update to primecount-7.1 (API & ABI are backwards compatible). - Minor pi(x) & phi(x, a) speed improvements. - PhiTiny.cpp: Use compressed phi(x, a) lookup table. - phi.cpp: More correct usage of recursive phi(x, a) formula. - PiTable.cpp: Add PrimePi(x) lookup table for x < 64 * 240. - generate_phi.hpp: More correct usage of recursive phi(x, a) formula. - nth_prime.cpp: Cache small primes <= 1009. - nth_prime.cpp: Improve error handling, n must be >= 1. - appveyor.yml: Fix debug build.
Comments 0