NetBSD-Bugs archive
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index][Old Index]
PR/52976 CVS commit: src/games/primes
The following reply was made to PR bin/52976; it has been noted by GNATS.
From: "Christos Zoulas" <christos%netbsd.org@localhost>
To: gnats-bugs%gnats.NetBSD.org@localhost
Cc:
Subject: PR/52976 CVS commit: src/games/primes
Date: Sat, 3 Feb 2018 10:40:29 -0500
Module Name: src
Committed By: christos
Date: Sat Feb 3 15:40:29 UTC 2018
Modified Files:
src/games/primes: primes.6 primes.c primes.h spsp.c
Log Message:
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
To generate a diff of this commit:
cvs rdiff -u -r1.5 -r1.6 src/games/primes/primes.6
cvs rdiff -u -r1.21 -r1.22 src/games/primes/primes.c
cvs rdiff -u -r1.6 -r1.7 src/games/primes/primes.h
cvs rdiff -u -r1.1 -r1.2 src/games/primes/spsp.c
Please note that diffs are not public domain; they are subject to the
copyright notices on the relevant files.
Home |
Main Index |
Thread Index |
Old Index