On the primes in the interval [3n,4n]

MaRDI QIDQ2898688zbMATH OpenFDO

Authors Andy Loo

Publication date 11 July 2012

Published in International Journal of Contemporary Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1110.2377, http://www.m-hikari.com/ijcms-2011/37-40-2011/index.html

zbMATH Keywords

prime numbers

Mathematics Subject Classification ID

Primes (11A41) Distribution of primes (11N05)

Abstract: For the old question whether there is always a prime in the interval [kn, (k+1)n] or not, the famous Bertrand's postulate gave an affirmative answer for k=1. It was first proved by P.L. Chebyshev in 1850, and an elegant elementary proof was given by P. Erdos in 1932. M. El Bachraoui used elementary techniques to prove the case k=2 in 2006. This paper gives a proof of the case k=3, again without using the prime number theorem or any deep analytic result. In addition we give a lower bound for the number of primes in the interval [3n, 4n], which shows that as n tends to infinity, the number of primes in the interval [3n, 4n] goes to infinity.

Review text

Modifying the elementary argument used by \textit{P. Erdős} to prove Bertrand's postulate stating that for any positive integer \(n\) there is always a prime number in the interval \([n, 2n]\) (see [Acta Litt. Sci. Szeged 5, 194--198 (1932; Zbl 0004.10103)]), this reviewer extended Bertrand's postulate and proved that for any positive integer \(n\) there is a prime number in the interval \([2n, 3n]\), [Int. J. Contemp. Math. Sci. 1, No. 13--16, 617--621 (2006; Zbl 1154.11303)]. In the paper at hand, the author uses similar arguments to prove that for any positive integer \(n\) there exists a prime in the interval \([3n, 4n]\). Moreover, the author gives a lower bound for the number of primes in \([3n, 4n]\) which implies that the number of primes in this interval tends to infinity as \(n\) approaches infinity.

Recommendations

• Primes in the interval [2n,3n]
• Extending Bertrand's postulate
• On the function (x)
• Estimates for the sequence of primes
• scientific article; zbMATH DE number 7658030

Cited in

(13)

• Primes in Ze^{(2\pi i/3)}
• Primes in the interval [2n,3n]
• Further sharpening of Euclid's argument on the infinitude of primes
• scientific article; zbMATH DE number 21654 (Why is no real title available?)
• scientific article; zbMATH DE number 3582250 (Why is no real title available?)
• Euclid's Argument on the Infinitude of Primes
• Extending Bertrand's postulate
• Explicit interval estimates for prime numbers
• Parsimony and inference to the best mathematical explanation
• Proof of the prime ladder conjecture
• Graph pattern detection: hardness for all induced patterns and faster noninduced cycles
• Generalizations of Bertrand’s Postulate to Sums of Any Number of Primes
• Existence of primes in the interval \([15x, 16x]\). An entirely elementary proof

This page was built for publication: On the primes in the interval \([3n,4n]\)

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