Abstract
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some “minimal” reasoning (i.e., in the theory IΔ 0 ) using concepts such as (the logarithm) of a binomial coefficient. In fact we prove Bertrand’s Postulate (that there is at least a prime number between n and 2n, for all n > 1) and the fact that the number of prime numbers between n and 2n is of order Θ(n/ln (n)). The proofs that we formalize are much simpler than several existing formalizations, and our theory turns out to be a sub-theory of a recent theory proposed by Woods and Cornaros that extends IΔ 0 by a special counting function.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bennett, J.: On Spectra. PhD thesis, Princeton University, Department of Mathematics (1962)
Buss, S.: First–Order Proof Theory of Arithmetic. In: Buss, S. (ed.) Handbook of Proof Theory, pp. 79–147. Elsevier, Amsterdam (1998)
Cornaros, C., Dimitracopoulos, C.: The Prime Number Theorem and Fragments of PA. Archive for Mathematical Logic 33, 265–281 (1994)
Cook, S., Nguyen, P.: Foundations of Proof Complexity: Bounded Arithmetic and Propositional Translations (Book in progress, 2006)
Cook, S.: Bounded Reverse Mathematics. In: Plenary Lecture for CiE 2007 (2007)
Cornaros, C.: On Grzegorczyk Induction. Annals of Pure and Applied Logic 74, 1–21 (1995)
Hájek, P., Pudlák, P.: Metamathematics of First-Order Arithmetic. Springer, Heidelberg (1993)
Krajíček, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press, Cambridge (1995)
Moser, L.: A theorem on the distribution of primes. American Mathematical Monthly 56(9), 624–625 (1949)
Nguyen, P., Cook, S.: Theory for TC 0and Other Small Complexity Classes. Logical Methods in Computer Science 2 (2005)
Nguyen, P.: Bounded Reverse Mathematics. PhD thesis, University of Toronto (2008), http://www.cs.toronto.edu/~pnguyen/
Nguyen, P.: Proving Infinitude of Prime Numbers Using Binomial Coefficients (submitted, 2008), http://www.cs.toronto.edu/~pnguyen/
Paris, J.B., Wilkie, A.J., Woods, A.R.: Provability of the pigeonhole principle and the existence of infinitely many primes. Journal of Symbolic Logic 53(4), 1235–1244 (1988)
Woods, A., Cornaros, C.: On bounded arithmetic augmented by the ability to count certain sets of primes (unpublished, 2007)
Woods, A.: Some Problems in Logic and Number Theory and Their Connections. PhD thesis, University of Manchester (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, P. (2008). Proving Infinitude of Prime Numbers Using Binomial Coefficients. In: Kaminski, M., Martini, S. (eds) Computer Science Logic. CSL 2008. Lecture Notes in Computer Science, vol 5213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87531-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-87531-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87530-7
Online ISBN: 978-3-540-87531-4
eBook Packages: Computer ScienceComputer Science (R0)