.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.47.8.
.TH PRIMESIEVE "1" "January 2019" ""primesieve 7.3"" ""primesieve""
.SH NAME
primesieve \- efficient prime number generator
.SH SYNOPSIS
.B primesieve
[\fI\,START\/\fR] \fI\,STOP \/\fR[\fI\,OPTION\/\fR]...
.SH DESCRIPTION
Generate the primes and/or prime k\-tuplets inside [START, STOP]
(< 2^64) using the segmented sieve of Eratosthenes.
.SH OPTIONS
.TP
\fB\-c[N\fR+], \fB\-\-count[\fR=\fI\,N\/\fR+]
Count primes and prime k\-tuplets, N <= 6,
e.g. \fB\-c1\fR primes, \fB\-c2\fR twins, \fB\-c3\fR triplets, ...
.TP
\fB\-\-cpu\-info\fR
Print CPU information
.TP
\fB\-d\fR<N>,  \fB\-\-dist=\fR<N>
Sieve the interval [START, START + N]
.TP
\fB\-h\fR,     \fB\-\-help\fR
Print this help menu
.TP
\fB\-n\fR,     \fB\-\-nth\-prime\fR
Calculate the nth prime,
e.g. 1 100 \fB\-n\fR finds the 1st prime > 100
.TP
\fB\-\-no\-status\fR
Turn off the progressing status
.TP
\fB\-p[N]\fR,  \fB\-\-print\fR[=\fI\,N\/\fR]
Print primes or prime k\-tuplets, N <= 6,
e.g. \fB\-p1\fR primes, \fB\-p2\fR twins, \fB\-p3\fR triplets, ...
.TP
\fB\-q\fR,     \fB\-\-quiet\fR
Quiet mode, prints less output
.TP
\fB\-s\fR<N>,  \fB\-\-size=\fR<N>
Set the sieve size in KiB, N <= 4096
.TP
\fB\-t\fR<N>,  \fB\-\-threads=\fR<N>
Set the number of threads, N <= CPU cores
.TP
\fB\-\-time\fR
Print the time elapsed in seconds
.TP
\fB\-v\fR,     \fB\-\-version\fR
Print version and license information
.SH EXAMPLES
.TP
primesieve 1000
Count the primes below 1000
.TP
primesieve 1000 \-c2
Count the twin primes below 1000
.TP
primesieve 1e6 \-p
Print the primes below 10^6
.TP
primesieve 100 200 \-p
Print the primes inside [100, 200]
.SH COPYRIGHT
Copyright \(co 2010 \- 2019 Kim Walisch
.PP
BSD 2\-Clause License <https://opensource.org/licenses/BSD\-2\-Clause>