Ramanujan Primes and Bertrand's Postulate

@article{Sondow2009RamanujanPA,
  title={Ramanujan Primes and Bertrand's Postulate},
  author={Jonathan Sondow},
  journal={The American Mathematical Monthly},
  year={2009},
  volume={116},
  pages={630 - 635}
}
  • J. Sondow
  • Published 29 July 2009
  • Mathematics
  • The American Mathematical Monthly
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… 

Ramanujan Primes: Bounds, Runs, Twins, and Gaps

The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that if $x \ge R_n$, then the interval $(x/2,x]$ contains at least $n$ primes. We sharpen Laishram's theorem that $R_n < p_{3n}$

On the number of primes up to the $n$th Ramanujan prime

The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that for all $x \geq R_n$ the interval $(x/2, x]$ contains at least $n$ primes. In this paper we undertake a study of the

On the estimates of the upper and lower bounds of Ramanujan primes

For $$n\ge 1$$n≥1, the nth Ramanujan prime is defined as the least positive integer $$R_{n}$$Rn such that for all $$x\ge R_{n}$$x≥Rn, the interval $$(\frac{x}{2}, x]$$(x2,x] has at least n primes.

On generalized Ramanujan primes

In this paper, we establish several results concerning the generalized Ramanujan primes. For $$n\in \mathbb {N}$$n∈N and $$k \in \mathbb {R}_{> 1}$$k∈R>1, we give estimates for the $$n$$nth

New upper bounds for Ramanujan primes

For $n\ge 1$, the $n^{\rm th}$ Ramanujan prime is defined as the smallest positive integer $R_n$ such that for all $x\ge R_n$, the interval $(\frac{x}{2}, x]$ has at least $n$ primes. We show that

Generalized Ramanujan Primes

In 1845, Bertrand conjectured that for all integers x ≥ 2, there exists at least one prime in (x∕2, x]. This was proved by Chebyshev in 1860 and then generalized by Ramanujan in 1919. He showed that

On a conjecture on Ramanujan primes

For n ≥ 1, the nth Ramanujan prime is defined to be the smallest positive integer Rn with the property that if x ≥ Rn, then $\pi(x)-\pi(\frac{x}{2})\ge n$ where π(ν) is the number of primes not

An Upper Bound for Ramanujan Primes

This work states that for each > 0, there exists an N such that Rn < p[2n(1+ )] for all n > N .

Insulated primes.

The degree of insulation $D(p)$ of a prime $p$ is defined as the largest interval around the prime $p$ in which no other prime is present. Based on this, the $n$-th prime $p_{n}$ is said to be

Set Families with Low Pairwise Intersection

The explicit construction of weak $\left(n,\ell,\gamma\right)$-sharing set families can be used to obtain a parallelizable pseudorandom number generator with a low memory footprint by using the pseudorrandom number generator of Nisan and Wigderson.

References

SHOWING 1-10 OF 17 REFERENCES

On a conjecture on Ramanujan primes

For n ≥ 1, the nth Ramanujan prime is defined to be the smallest positive integer Rn with the property that if x ≥ Rn, then $\pi(x)-\pi(\frac{x}{2})\ge n$ where π(ν) is the number of primes not

Ramanujan and I

Perhaps the title "Ramanujan and the birth of Probabilistic Number Theory" would have been more appropriate and personal, but since Ramanujan's work influenced me greatly in other subjects too, I

The Book of Prime Number Records

1. How Many Prime Numbers Are There?.- I. Euclid's Proof.- II. Kummer's Proof.- III. Polya's Proof.- IV. Euler's Proof.- V. Thue's Proof.- VI. Two-and-a-Half Forgotten Proofs.- A. Perott's Proof.- B.

Existence of Ramanujan primes for GL(3)

In this Note we show that given any cusp form \pi on GL(3) over the rationals, there exist an infinite number of primes p which are Ramanujan for \pi, i.e., that the local components \pi_p are

Lecture Notes in Mathematics

Vol. 72: The Syntax and Semantics of lnfimtary Languages. Edited by J. Barwtse. IV, 268 pages. 1968. DM 18,I $ 5.00 Vol. 73: P. E. Conner, Lectures on the Action of a Finite Group. IV, 123 pages.

Sharper bounds for the Chebyshev functions $\theta (x)$ and $\psi (x)$

Abstract : The authors demonstrate a wider zero-free region for the Riemann zeta function than has been given before. They give improved methods for using this and a recent determination that

The On-Line Encyclopedia of Integer Sequences

  • N. Sloane
  • Computer Science
    Electron. J. Comb.
  • 1994
The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used.

Collected Papers of Srinivasa Ramanujan

RAMANUJAN was born in India in December 1887, came to Trinity College, Cambridge, in April 1914, was ill from May 1917 onwards, returned to India in February 1919, and died in April 1920. He was a

Mathematical constants

  • S. Finch
  • Mathematics
    Encyclopedia of mathematics and its applications
  • 2005
UCBL-20418 This collection of mathematical data consists of two tables of decimal constants arranged according to size rather than function, a third table of integers from 1 to 1000, giving some of

The nth prime is greater than n ln n

  • Proc. London Math. Soc
  • 1938