The Lucas-Pratt primality tree

DOI10.1090/S0025-5718-07-02002-9MaRDI QIDQ5429510zbMATH OpenFDO

Authors Jonathan Bayless

Publication date 30 November 2007

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

Full work available at URL https://doi.org/10.1090/S0025-5718-07-02002-9

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Primality (11Y11) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 17386
• Primality proving via one round in ECPP and one iteration in AKS
• Every Prime Has a Succinct Certificate
• Explicit primality criteria for (p-1)p^n-1
• Proving primality in essentially quartic random time

Cites work

• Every Prime Has a Succinct Certificate
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 193573 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• Irreducible radical extensions and Euler-function chains
• On values taken by the largest prime factor of shifted primes
• PRIMES is in P
• The large sieve
• Very Short Primality Proofs

Cited in

(4)

• Every Prime Has a Succinct Certificate
• THE MAXIMAL ORDER OF ITERATED MULTIPLICATIVE FUNCTIONS
• Prime chains and Pratt trees
• Two remarks on iterates of Euler's totient function

This page was built for publication: The Lucas-Pratt primality tree

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