An elemetary proof of an estimate for a number of primes less than the product of the first n primes

arXiv1211.4571MaRDI QIDQ6237310FDOQ6237310

Authors: Romeo Meštrović 

Publication date: 17 November 2012

Abstract: Let $alpha$ be a real number such that $1<alpha<2$ and let $x_0=x_0(alpha)$ be a { m(}unique{ m)} positive solution of the equation ${\displaystyle }$ x^{alpha-1} -frac{pi}{e^2sqrt{3}}x +1=0. ${\displaystyle }$ Then we prove that for each positive integer $n>x_0$ there exist at least $[n^{a}lpha]$ primes between the $(n+1)$th prime and the product of the first $n+1$ primes. In particular, we establish a recent Cooke's result which asserts that for each positive integer $n$ there are at least $n$ primes between the $(n+1)$th prime and the product of the first $n+1$ primes. Our proof is based on an elementary counting method (enumerative arguments) and the application of Stirling's formula to give upper bound for some binomial coefficients.

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Primes (11A41) Factorization; primality (11A51)

This page was built for publication: An elemetary proof of an estimate for a number of primes less than the product of the first $n$ primes

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