1.\" $NetBSD: primes.6,v 1.6 2018/02/03 15:40:29 christos Exp $ 2.\" 3.\" Copyright (c) 1989, 1993 4.\" The Regents of the University of California. All rights reserved. 5.\" 6.\" This code is derived from software contributed to Berkeley by 7.\" Landon Curt Noll. 8.\" 9.\" Redistribution and use in source and binary forms, with or without 10.\" modification, are permitted provided that the following conditions 11.\" are met: 12.\" 1. Redistributions of source code must retain the above copyright 13.\" notice, this list of conditions and the following disclaimer. 14.\" 2. Redistributions in binary form must reproduce the above copyright 15.\" notice, this list of conditions and the following disclaimer in the 16.\" documentation and/or other materials provided with the distribution. 17.\" 3. Neither the name of the University nor the names of its contributors 18.\" may be used to endorse or promote products derived from this software 19.\" without specific prior written permission. 20.\" 21.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31.\" SUCH DAMAGE. 32.\" 33.\" @(#)factor.6 8.1 (Berkeley) 5/31/93 34.\" 35.\" 36.\" By Landon Curt Noll, http://www.isthe.com/chongo/index.html /\oo/\ 37.\" 38.Dd February 2, 2018 39.Dt PRIMES 6 40.Os 41.Sh NAME 42.Nm primes 43.Nd generate primes 44.Sh SYNOPSIS 45.Nm primes 46.Op Fl dh 47.Op Ar start Op Ar stop 48.Sh DESCRIPTION 49The 50.Nm 51utility prints primes in ascending order, one per line, starting 52at or above 53.Ar start 54and continuing until, but not including 55.Ar stop . 56The 57.Ar start 58value must be at least 0 and not greater than 59.Ar stop . 60The 61.Ar stop 62value must not be greater than 3825123056546413050. 63The default value of 64.Ar stop 65is 3825123056546413050. 66.Pp 67When the 68.Nm 69utility is invoked with no arguments, 70.Ar start 71is read from standard input and 72.Ar stop 73is taken to be 3825123056546413050. 74The 75.Ar start 76value may be preceded by a single 77.Sq \&+ . 78The 79.Ar start 80value is terminated by a non-digit character (such as a newline). 81The input line must not be longer than 255 characters. 82.Pp 83When given the 84.Fl d 85argument, 86.Nm 87prints the difference between the current and the previous prime. 88.Pp 89When given the 90.Fl h 91argument, 92.Nm 93prints the prime numbers in hexadecimal. 94.Sh DIAGNOSTICS 95Out of range or invalid input results in 96an appropriate error message to standard error. 97.Sh AUTHORS 98.An -nosplit 99Originally by 100.An Landon Curt Noll , 101extended to some 64-bit primes by 102.An Colin Percival . 103.Sh BUGS 104This 105.Nm 106program won't get you a world record. 107