Sciweavers

Share
CSL
2008
Springer

Proving Infinitude of Prime Numbers Using Binomial Coefficients

9 years 1 months ago
Proving Infinitude of Prime Numbers Using Binomial Coefficients
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 I0) 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 I0 by a special counting function.
Phuong Nguyen
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where CSL
Authors Phuong Nguyen
Comments (0)
books