| factor.6 (216239) | factor.6 (272166) |
|---|---|
| 1.\" Copyright (c) 1989, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" This code is derived from software contributed to Berkeley by 5.\" Landon Curt Noll. 6.\" 7.\" Redistribution and use in source and binary forms, with or without 8.\" modification, are permitted provided that the following conditions --- 16 unchanged lines hidden (view full) --- 25.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29.\" SUCH DAMAGE. 30.\" 31.\" @(#)factor.6 8.1 (Berkeley) 5/31/93 32.\" | 1.\" Copyright (c) 1989, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" This code is derived from software contributed to Berkeley by 5.\" Landon Curt Noll. 6.\" 7.\" Redistribution and use in source and binary forms, with or without 8.\" modification, are permitted provided that the following conditions --- 16 unchanged lines hidden (view full) --- 25.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29.\" SUCH DAMAGE. 30.\" 31.\" @(#)factor.6 8.1 (Berkeley) 5/31/93 32.\" |
| 33.\" $FreeBSD: head/games/factor/factor.6 216239 2010-12-06 19:12:51Z uqs $ | 33.\" $FreeBSD: head/games/factor/factor.6 272166 2014-09-26 09:40:48Z cperciva $ |
| 34.\" 35.\" By: Landon Curt Noll chongo@toad.com, ...!{sun,tolsoft}!hoptoad!chongo 36.\" 37.\" chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\ 38.\" 39.Dd October 10, 2002 40.Dt FACTOR 6 41.Os --- 43 unchanged lines hidden (view full) --- 85value must be at least 0 and not greater than 86.Ar stop . 87The 88.Ar stop 89value must not be greater than the maximum. 90The default and maximum value of 91.Ar stop 92is 4294967295 on 32-bit architectures | 34.\" 35.\" By: Landon Curt Noll chongo@toad.com, ...!{sun,tolsoft}!hoptoad!chongo 36.\" 37.\" chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\ 38.\" 39.Dd October 10, 2002 40.Dt FACTOR 6 41.Os --- 43 unchanged lines hidden (view full) --- 85value must be at least 0 and not greater than 86.Ar stop . 87The 88.Ar stop 89value must not be greater than the maximum. 90The default and maximum value of 91.Ar stop 92is 4294967295 on 32-bit architectures |
| 93and 18446744073709551615 on 64-bit ones. | 93and 3825123056546413050 on 64-bit ones. |
| 94.Pp 95When the 96.Nm primes 97utility is invoked with no arguments, 98.Ar start 99is read from standard input and 100.Ar stop 101is taken to be the maximum. --- 13 unchanged lines hidden (view full) --- 115.El 116.Sh BUGS 117.Nm 118cannot handle the 119.Dq "10 most wanted" 120factor list, 121.Nm primes 122will not get you a world record. | 94.Pp 95When the 96.Nm primes 97utility is invoked with no arguments, 98.Ar start 99is read from standard input and 100.Ar stop 101is taken to be the maximum. --- 13 unchanged lines hidden (view full) --- 115.El 116.Sh BUGS 117.Nm 118cannot handle the 119.Dq "10 most wanted" 120factor list, 121.Nm primes 122will not get you a world record. |
| 123.Pp 124.Nm primes 125is unable to list primes between 3825123056546413050 and 18446744073709551615 126since it relies on strong pseudoprime tests after sieving, and nobody has 127proven how many strong pseudoprime tests are required to prove primality for 128integers larger than 3825123056546413050. |
|