Fast Primality Tests for Numbers Less Than 50 ⋅10 9

DOI10.2307/2008007MaRDI QIDQ3724396zbMATH OpenOpenAlexFDO

Authors G. C. Kurtz, Daniel Shanks, Hugh C. Williams

Publication date 1986

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2008007

zbMATH Keywords

computational number theorycubic recurrencesdivisibility properties of sequencesfast primality testPerrin sequence

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41) Recurrences (11B37)

Recommendations

• An $O(n^{1/10.89))$ Primality Testing Algorithm,$
• scientific article; zbMATH DE number 4215363
• A faster pseudo-primality test
• A Fast Monte-Carlo Test for Primality
• New fast methods to compute the number of primes smaller than a given value
• Algorithmic Number Theory
• Fast compact prime number sieves (among others)
• scientific article; zbMATH DE number 1331127
• Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
• scientific article; zbMATH DE number 5845877

Cited in

(11)

• Frobenius pseudoprimes
• An \(\tilde{O}(\log^{2}(N))\) time primality test for generalized Cullen numbers
• The Primality of R1031
• Primes at a Glance
• On the Number of Elliptic Pseudoprimes
• A Fast Monte-Carlo Test for Primality
• scientific article; zbMATH DE number 1210365 (Why is no real title available?)
• scientific article; zbMATH DE number 647571 (Why is no real title available?)
• scientific article; zbMATH DE number 1406839 (Why is no real title available?)
• Extending Babbage's (non-)primality tests
• On Almost Primes

This page was built for publication: Fast Primality Tests for Numbers Less Than 50 ⋅10 9

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3724396)