1PRIMESIEVE(1)                     primesieve                     PRIMESIEVE(1)
2
3
4

NAME

6       primesieve - efficient prime number generator
7

SYNOPSIS

9       primesieve [START] STOP [OPTION]...
10

DESCRIPTION

12       Generate  the  primes  and/or  prime  k-tuplets inside [START, STOP] (<
13       2^64) using the segmented sieve of Eratosthenes.
14

OPTIONS

16       -c[N+], --count[=N+]
17              Count primes and prime k-tuplets, N <= 6, e.g. -c1  primes,  -c2
18              twins, -c3 triplets, ...
19
20       --cpu-info
21              Print CPU information
22
23       -d<N>,  --dist=<N>
24              Sieve the interval [START, START + N]
25
26       -h,     --help
27              Print this help menu
28
29       -n,     --nth-prime
30              Calculate the nth prime, e.g. 1 100 -n finds the 1st prime > 100
31
32       --no-status
33              Turn off the progressing status
34
35       -p[N],  --print[=N]
36              Print  primes  or  prime k-tuplets, N <= 6, e.g. -p1 primes, -p2
37              twins, -p3 triplets, ...
38
39       -q,     --quiet
40              Quiet mode, prints less output
41
42       -s<N>,  --size=<N>
43              Set the sieve size in KiB, N <= 4096
44
45       --test Run various sieving tests
46
47       -t<N>,  --threads=<N>
48              Set the number of threads, N <= CPU cores
49
50       --time Print the time elapsed in seconds
51
52       -v,     --version
53              Print version and license information
54

EXAMPLES

56       primesieve 1000
57              Count the primes below 1000
58
59       primesieve 1000 -c2
60              Count the twin primes below 1000
61
62       primesieve 1e6 -p
63              Print the primes below 10^6
64
65       primesieve 100 200 -p
66              Print the primes inside [100, 200]
67

69       Copyright © 2010 - 2019 Kim Walisch
70
71       BSD 2-Clause License <https://opensource.org/licenses/BSD-2-Clause>
72
73
74
75                                  April 2019                     PRIMESIEVE(1)
Impressum