Efficient storage of all primes up to some n

[Dr Sardonicus]

Originally Posted by ewmayer

FYI, It seems the pseudoprime page I linked in my code comment has moved to http://www.numericana.com/answer/pseudo.htm#pseudoprime .

This site is well worth a visit for the cross-references between pseudoprimes to different bases and Carmichael numbers; also links to pages about Fermat, Poulet, etc. [Nit-pick: tables of base-2 psp's (as opposed to how many there are with up to a given number of decimal digits) not present.]

Other tables of various sorts of pseudoprimes up to 10¹⁴ are readily accessible (Just click on "data" in the column headings) at

Pseudoprime Statistics, Tables, and Data (Fermat, Miller-Rabin, Lucas, Fibonacci, Pell, Frobenius, Baillie-PSW).

Note the small number of Perrin pseudoprimes.

[ewmayer]

Originally Posted by Dr Sardonicus

This site is well worth a visit for the cross-references between pseudoprimes to different bases and Carmichael numbers; also links to pages about Fermat, Poulet, etc. [Nit-pick: tables of base-2 psp's (as opposed to how many there are with up to a given number of decimal digits) not present.]

I've attached the header file from my Mlucas source archive which has the base-2 psp's < 2^32, in the 2-table form (those divisible by 3 or 5 and those not) in which I use them.