- Accept octal input.

[bsdgames-darwin.git] / primes / primes.6

diff --git a/primes/primes.6 b/primes/primes.6
index 6928fe661218375fb9df0f5429533a31f00adbcd..aa000ef47451d2c11add09f627d0627ed1396602 100644 (file)
--- a/primes/primes.6
+++ b/primes/primes.6
@@ -1,4 +1,4 @@
-.\"    $NetBSD: primes.6,v 1.4 2014/10/02 21:36:37 ast Exp $
+.\"    $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.
@@ -35,7 +35,7 @@
 .\"
 .\" By Landon Curt Noll, http://www.isthe.com/chongo/index.html /\oo/\
 .\"
-.Dd February 3, 2008
+.Dd February 2, 2018
 .Dt PRIMES 6
 .Os
 .Sh NAME
@@ -43,8 +43,7 @@
 .Nd generate primes
 .Sh SYNOPSIS
 .Nm primes
-.Op Fl d
-.Op Fl h
+.Op Fl dh
 .Op Ar start Op Ar stop
 .Sh DESCRIPTION
 The
@@ -96,18 +95,12 @@ prints the prime numbers in hexadecimal.
 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 CAVEATS
+.Sh BUGS
 This
 .Nm
 program won't get you a world record.
-.Pp
-The program is not able to list primes between
-3825123056546413050 and 18446744073709551615 (2^64
-- 1) as it relies on strong pseudoprime tests after
-sieving, and it is yet unknown how many of those
-tests are needed to prove primality for integers
-larger than 3825123056546413050.