From e5c17e55df9ac3ba0cc4e6836b1296ca4e09c863 Mon Sep 17 00:00:00 2001 From: christos Date: Sat, 3 Feb 2018 15:40:29 +0000 Subject: 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 --- primes/primes.6 | 13 +++---------- 1 file changed, 3 insertions(+), 10 deletions(-) (limited to 'primes/primes.6') diff --git a/primes/primes.6 b/primes/primes.6 index 36c76cd1..aa000ef4 100644 --- a/primes/primes.6 +++ b/primes/primes.6 @@ -1,4 +1,4 @@ -.\" $NetBSD: primes.6,v 1.5 2014/10/04 13:15:50 wiz 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 @@ -100,14 +100,7 @@ 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. -- cgit v1.2.3