### primes (6)

#### Leading comments

$NetBSD: primes.6,v 1.3 2008/02/03 03:29:17 wiz 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 follow...

#### NAME

**primes**- generate primes

#### SYNOPSIS

**primes**[-

**d**] [

*start*[

*stop*] ]

#### DESCRIPTION

The utility prints primes in ascending order, one per line, starting at or above*start*and continuing until, but not including

*stop*The

*start*value must be at least 0 and not greater than

*stop*The

*stop*value must not be greater than the maximum possible value of unsigned integer types on your system (4294967295 for 32-bit systems and 18446744073709551615 for 64-bit systems). The default value of

*stop*is 4294967295 on 32-bit and 18446744073709551615 on 64-bit.

When the
utility is invoked with no arguments,
*start*
is read from standard input.
*stop*
is taken to be 4294967295 on 32-bit and 18446744073709551615 on 64-bit.
The
*start*
value may be preceded by a single
`+'
The
*start*
value is terminated by a non-digit character (such as a newline).
The input line must not be longer than 255 characters.
When given the
-**d**
argument,
prints the difference between the current and the previous prime.