Aren
/
NetBSD
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
NetBSD/games/primes
History
christos 2429b427fa 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
 		2018-02-03 15:40:29 +00:00
..
Makefile Imported and adapted from FreeBSD svn r272166 and r272207; this fixes 2014-10-02 21:36:37 +00:00
pattern.c Imported and adapted from FreeBSD svn r272166 and r272207; this fixes 2014-10-02 21:36:37 +00:00
pr_tbl.c Imported and adapted from FreeBSD svn r272166 and r272207; this fixes 2014-10-02 21:36:37 +00:00
primes.6 PR/52976: Eitan Adler: handle larger primes 2018-02-03 15:40:29 +00:00
primes.c PR/52976: Eitan Adler: handle larger primes 2018-02-03 15:40:29 +00:00
primes.h PR/52976: Eitan Adler: handle larger primes 2018-02-03 15:40:29 +00:00
spsp.c PR/52976: Eitan Adler: handle larger primes 2018-02-03 15:40:29 +00:00