Mathematics – Number Theory
Scientific paper
2009-07-29
Amer. Math. Monthly 116 (2009) 630-635
Mathematics
Number Theory
7 pages, cited Shapiro's book for Ramanujan's proof of Bertrand's Postulate
Scientific paper
The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that if $x \ge R_n$, then there are at least $n$ primes in the interval $(x/2,x]$. For example, Bertrand's postulate is $R_1 = 2$. Ramanujan proved that $R_n$ exists and gave the first five values as 2, 11, 17, 29, 41. In this note, we use inequalities of Rosser and Schoenfeld to prove that $2n \log 2n < R_n < 4n \log 4n$ for all $n$, and we use the Prime Number Theorem to show that $R_n$ is asymptotic to the $2n$th prime. We also estimate the length of the longest string of consecutive Ramanujan primes among the first $n$ primes, explain why there are more twin Ramanujan primes than expected, and make three conjectures (the first has since been proved by S. Laishram).
No associations
LandOfFree
Ramanujan Primes and Bertrand's Postulate does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Ramanujan Primes and Bertrand's Postulate, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ramanujan Primes and Bertrand's Postulate will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-468571