PRIMESIEVE(1) PRIMESIEVE(1) (NAME) primesieve - (SYNOPSIS) primesieve [START] STOP [OPTION]... (DESCRIPTION) / (k-tuplets) [START, STOP] (< 2^64) (segmented sieve of Eratosthenes). primesieve : (wheel factorization) (bucket sieve) (cache) > 2^32 . primesieve (multi-threaded) n- . O(n log log n) O(n^(1/2)) . primesieve PrimePi(n^(1/2)) * 8 ( ) . (OPTIONS) -c[NUM+], --count[=NUM+] / 1 <= NUM <= 6. : -c --count : -c2 --count=2 : -c3 --count=3 . -c123 . --cpu-info : . -d, --dist=DIST [START, START + DIST]. -h, --help . -n, --nth-prime n- 100 -n . N START n- > START 2 100 -n > 100 . --no-status . -p[NUM], --print[=NUM] 1 <= NUM <= 6. : -p : -p2 : -p3 . -q, --quiet . -R, --RiemannR PrimePi(x) R : R(x). --RiemannR-inverse n- R : R^-1(x). -s, --size=SIZE KiB 16 <= SIZE <= 8192 . primesieve L1 ( ) L2 . primesieve . L1 L2 ( ) . -S, --stress-test[=MODE] (stress test). MODE CPU () RAM . CPU (< 5 MiB ) . RAM CPU ( 1.16 GiB) CPU . ( ) . --timeout=SECS . --threads=NUM . --test (< 1 ). -t, --threads=NUM 1 <= NUM <= . primesieve n- . --time . --timeout=SECS . s m h d y --timeout 10m . . -v, --version . (EXAMPLES) primesieve 1000 <= 1000. primesieve 1e6 --print <= 10^6. primesieve 1e6 --print > primes.txt <= 10^6 . primesieve 2^32 --print=2 <= 2^32. primesieve 1e16 --dist=1e10 --threads=1 [10^16, 10^16 + 10^10] . (HOMEPAGE) https://github.com/kimwalisch/primesieve (AUTHORS) Kim Walisch 02/17/2024 PRIMESIEVE(1)