Proving Infinitude of Prime Numbers Using Binomial Coefficients

DOI10.1007/978-3-540-87531-4_15zbMATH Open1157.03033OpenAlexW2119737270MaRDI QIDQ3540179FDOQ3540179

Authors:

Publication date: 20 November 2008

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_15

Recommendations

• On bounded arithmetic augmented by the ability to count certain sets of primes
• The prime number theorem is PRA-provable
• scientific article; zbMATH DE number 1834646
• Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms
• Two short proofs of the infinitude of primes

Mathematics Subject Classification ID

Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Primes (11A41)

Cited In (2)

• On bounded arithmetic augmented by the ability to count certain sets of primes
• Short propositional refutations for dense random 3CNF formulas

This page was built for publication: Proving Infinitude of Prime Numbers Using Binomial Coefficients

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