Proving pearl: Knuth's algorithm for prime numbers

DOI10.1007/10930755_20MaRDI QIDQ3559771zbMATH OpenOpenAlexFDO

Authors Laurent Théry

Publication date 7 May 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10930755_20

Mathematics Subject Classification ID

Primes (11A41) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Mechanisation of the AKS algorithm
• Mechanisation of AKS algorithm. I. The main theorem
• Decision problem \texttt{PRIMES}
• Some negative results concerning prime number generators
• Formal and efficient primality proofs by use of computer algebra oracles

Cited in

(6)

• Mechanisation of the AKS algorithm
• A refinement of the Conway algorithm
• About the Formalization of Some Results by Chebyshev in Number Theory
• Some negative results concerning prime number generators
• Nine Chapters of Analytic Number Theory in Isabelle/HOL.
• Turner, Bird, Eratosthenes: an eternal burning thread

Describes a project that uses

Uses Software

• Coq

This page was built for publication: Proving pearl: Knuth's algorithm for prime numbers

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