Ramanujan prime

In mathematics, a Ramanujan prime is a prime number that satisfies a result proven by Srinivasa Ramanujan relating to the prime-counting function.

Origins and definition

In 1919, Ramanujan published a new proof [S. Ramanujan, "A proof of Bertrand's postulate". "Journal of the Indian Mathematical Society" 11 (1919), 181–182. [http://www.imsc.res.in/~rao/ramanujan/CamUnivCpapers/Cpaper24/page1.htm] ] of Bertrand's postulate which, as he says, was first proved by Chebyshev. At the end of the two-page published paper, Ramanujan derived a generalized result, and that is:

: pi(x) - pi(x/2) ≥ 1, 2, 3, 4, 5, ... for all "x" ≥ 2, 11, 17, 29, 41, ... ]

Another way to put this is:

:Ramanujan primes are the integers "Rn" that are the smallest to guarantee there would be "n" primes between "x" and "x/2" for all "x" ≥ "Rn".

Since "Rn" is the smallest such number, it must be a prime: pi(x) - pi(x/2) must increase by obtaining another prime.

References


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Ramanujan's sum — This article is not about Ramanujan summation. In number theory, a branch of mathematics, Ramanujan s sum, usually denoted c q ( n ), is a function of two positive integer variables q and n defined by the formula:c q(n)=sum {a=1atop… …   Wikipedia

  • Ramanujan graph — A Ramanujan graph, named after Srinivasa Ramanujan, is a regular graph whose spectral gap is almost as large as possible (see extremal graph theory). Such graphs are excellent spectral expanders.Examples of Ramanujan graphs include the clique,… …   Wikipedia

  • Ramanujan, Srinivasa — ▪ Indian mathematician born Dec. 22, 1887, Erode, India died April 26, 1920, Kumbakonam       Indian mathematician whose contributions to the theory of numbers include pioneering discoveries of the properties of the partition function.       When …   Universalium

  • Ramanujan–Petersson conjecture — In mathematics, the Ramanujan conjecture states that the Fourier coefficients au(n) of the cusp form Delta(z) of weight 12, defined in modular form theory, satisfy:| au(p)| leq 2p^{11/2},when p is a prime number. This implies an estimate that is… …   Wikipedia

  • Srinivasa Ramanujan — Infobox Scientist name=Srinivasa Ramanujan thumb|Srinivasa Ramanujan birth date = birth date|1887|12|22|df=y birth place = Erode, Tamil Nadu, India death date = death date and age|1920|4|26|1887|12|22|df=y death place = Chetput, (Madras), Tamil… …   Wikipedia

  • List of topics named after Srinivasa Ramanujan — Srinivasa Ramanujan (1887 1920) is the eponym of all of the topics listed below.*Dougall Ramanujan identity *Hardy Ramanujan number *Landau Ramanujan constant *Ramanujan s congruences *Ramanujan Nagell equation *Ramanujan Peterssen conjecture… …   Wikipedia

  • Nombre premier de Ramanujan — En mathématiques, un nombre premier de Ramanujan est un nombre premier qui satisfait un résultat démontré par Srinivasa Ramanujan relatif à la fonction de compte des nombres premiers. Origines et définition En 1919, Ramanujan publia une nouvelle… …   Wikipédia en Français

  • Hardy–Ramanujan theorem — In mathematics, the Hardy–Ramanujan theorem, proved by harvtxt|Hardy|Ramanujan|1917, states that the normal order of the number omega;( n ) of distinct prime factors of a number n is log(log( n )). Roughly speaking, this means that most numbers… …   Wikipedia

  • List of prime numbers — This is an incomplete list, which may never be able to satisfy particular standards for completeness. You can help by expanding it with reliably sourced entries. By Euclid s theorem, there are an infinite number of prime numbers. Subsets of the… …   Wikipedia

  • Graphe de Ramanujan — Article connexe : théorie des graphes extrémaux. Un graphe de Ramanujan, nommé d après Srinivasa Ramanujan, est un graphe régulier dont le gap spectral est presque aussi large que possible. De tels graphes sont d excellents graphes… …   Wikipédia en Français


Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.