Return to primes.6 CVS log | Up to [cvs.NetBSD.org] / src / games / primes |

File: [cvs.NetBSD.org] / src / games / primes / primes.6 (download)
Revision PR/52976: Eitan Adler: handle larger primes Using results from J. Sorenson and J. Webster, Strong pseudoprimes to twelve prime bases, Math. Comp. 86(304):985-1003, 2017. teach primes(6) to enumerate primes up to 2^64 - 1. Until Sorenson and Webster's paper, we did not know how many strong speudoprime tests were required when testing alleged primes between 3825123056546413051 and 2^64 - 1. Adapted from: FreeBSD |

.\" $NetBSD: primes.6,v 1.6 2018/02/03 15:40:29 christos Exp $ .\" .\" Copyright (c) 1989, 1993 .\" The Regents of the University of California. All rights reserved. .\" .\" This code is derived from software contributed to Berkeley by .\" Landon Curt Noll. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)factor.6 8.1 (Berkeley) 5/31/93 .\" .\" .\" By Landon Curt Noll, http://www.isthe.com/chongo/index.html /\oo/\ .\" .Dd February 2, 2018 .Dt PRIMES 6 .Os .Sh NAME .Nm primes .Nd generate primes .Sh SYNOPSIS .Nm primes .Op Fl dh .Op Ar start Op Ar stop .Sh DESCRIPTION The .Nm utility prints primes in ascending order, one per line, starting at or above .Ar start and continuing until, but not including .Ar stop . The .Ar start value must be at least 0 and not greater than .Ar stop . The .Ar stop value must not be greater than 3825123056546413050. The default value of .Ar stop is 3825123056546413050. .Pp When the .Nm utility is invoked with no arguments, .Ar start is read from standard input and .Ar stop is taken to be 3825123056546413050. The .Ar start value may be preceded by a single .Sq \&+ . The .Ar start value is terminated by a non-digit character (such as a newline). The input line must not be longer than 255 characters. .Pp When given the .Fl d argument, .Nm prints the difference between the current and the previous prime. .Pp When given the .Fl h argument, .Nm prints the prime numbers in hexadecimal. .Sh DIAGNOSTICS Out of range or invalid input results in an appropriate error message to standard error. .Sh AUTHORS .An -nosplit Originally by .An Landon Curt Noll , extended to some 64-bit primes by .An Colin Percival . .Sh BUGS This .Nm program won't get you a world record.