Hi Colin, Minor nitpicking follows.
On Sat, Jun 3, 2017 at 7:36 PM, Colin Percival <[email protected]> wrote: > Author: cperciva > Date: Sun Jun 4 02:36:37 2017 > New Revision: 319561 > URL: https://svnweb.freebsd.org/changeset/base/319561 > > Log: > 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. > ... > Modified: head/usr.bin/primes/primes.c > ============================================================================== > --- head/usr.bin/primes/primes.c Sun Jun 4 02:21:38 2017 > (r319560) > +++ head/usr.bin/primes/primes.c Sun Jun 4 02:36:37 2017 > (r319561) > @@ -120,7 +120,7 @@ main(int argc, char *argv[]) > argv += optind; > > start = 0; > - stop = SPSPMAX; > + stop = (uint64_t)(-1); Isn't this usually spelled UINT64_MAX? Best, Conrad _______________________________________________ [email protected] mailing list https://lists.freebsd.org/mailman/listinfo/svn-src-all To unsubscribe, send any mail to "[email protected]"
