mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Computer Science & Computational Number Theory (https://www.mersenneforum.org/forumdisplay.php?f=116)
-   -   Efficient storage of all primes up to some n (https://www.mersenneforum.org/showthread.php?t=24417)

 Dr Sardonicus 2019-05-12 20:39

[QUOTE=ewmayer;516556]FYI, It seems the pseudoprime page I linked in my code comment has moved to [url]http://www.numericana.com/answer/pseudo.htm#pseudoprime[/url] .[/QUOTE]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[sup]14[/sup] are readily accessible (Just click on "data" in the column headings) at

[url=http://ntheory.org/pseudoprimes.html]Pseudoprime Statistics, Tables, and Data[/url] (Fermat, Miller-Rabin, Lucas, Fibonacci, Pell, Frobenius, Baillie-PSW).

Note the small number of Perrin pseudoprimes.

 ewmayer 2019-05-12 21:11

1 Attachment(s)
[QUOTE=Dr Sardonicus;516559]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.][/QUOTE]

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.

All times are UTC. The time now is 23:46.