diff options
| author |   christos <christos@NetBSD.org> | 2018-02-03 15:40:29 +0000 |
|---|---|---|
| committer | christos <christos@NetBSD.org> | 2018-02-03 15:40:29 +0000 |
| commit | e5c17e55df9ac3ba0cc4e6836b1296ca4e09c863 (patch) | |
| tree | 583cfb88d5033a8358b72877f951c45d1307673f /primes/primes.h | |
| parent | 18958ee2a20b22fe016fc80f46385a0c7cbe04f1 (diff) | |
| download | bsdgames-darwin-e5c17e55df9ac3ba0cc4e6836b1296ca4e09c863.tar.gz bsdgames-darwin-e5c17e55df9ac3ba0cc4e6836b1296ca4e09c863.tar.zst bsdgames-darwin-e5c17e55df9ac3ba0cc4e6836b1296ca4e09c863.zip | |
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
Diffstat (limited to 'primes/primes.h')
| -rw-r--r-- | primes/primes.h | 5 |
1 files changed, 1 insertions, 4 deletions
diff --git a/primes/primes.h b/primes/primes.h index 20da4ef6..2c004465 100644 --- a/primes/primes.h +++ b/primes/primes.h @@ -1,4 +1,4 @@ -/* $NetBSD: primes.h,v 1.6 2014/10/02 21:36:37 ast Exp $ */ +/* $NetBSD: primes.h,v 1.7 2018/02/03 15:40:29 christos Exp $ */ /* * Copyright (c) 1989, 1993 @@ -69,6 +69,3 @@ extern const size_t pattern_size; /* length of pattern array */ /* Test for primality using strong pseudoprime tests. */ int isprime(uint64_t); - -/* Maximum value which the SPSP code can handle. */ -#define SPSPMAX 3825123056546413050ULL |