Pseudoprimes
main page
database
statistics
During my Mathematics education at the
Rijksuniversiteit Groningen, I stumbled upon the work of
Will Galway, who managed to enumerate all base-2 Fermat pseudoprimes below 10^15. Since then, I have been working on and off to extend his work to 2^64. Such a database could be used to devise a very fast 64-bit primality test.
The search is complete upto 10^17. The full 64-bit search is still running on computing facilities from the Rijksuniversiteit Groningen. It is expected to finish before the end of 2009, at which point I plan to disclose the algorithms used. Next to these efforts, David Cleaver and
Jeff Gilchrist have started performing double-checks using their own software.
News
2009-08-26
The preliminary 64-bit database (which is NOT yet available on this website!) has been updated once again, bringing the new total count to 118,968,378. See the
statistics page for all new counts.
2009-07-21
A bug was discovered which caused a few pseudoprimes to have been missed. The problem has been solved and the following 21 pseudoprimes were added on July 21st 2009:
14122015703347357
17496217707280705
20040643445643721
27539177808902581
32115647615203873
36838574561961601
44418991765929985
47813813004689593
51589143496832041
54199070165651593
54263349252712965
57605758133851201
58615189647667717
64057794198070465
70376674555760881
70843777951032541
70885284055839001
75979697849655601
76074008094610921
91133743975087177
95876286689842849