# Ramanujan prime

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

## Origins and definition

In 1919, Ramanujan published a new proof of Bertrand's postulate (which had already been proven by Pafnuty Chebyshev).

Ramanujan's result at the end of the paper was:

$\pi(x) - \pi(x/2)$ ≥ 1, 2, 3, 4, 5, ... for all x ≥ 2, 11, 17, 29, 41, ... (sequence A104272 in OEIS)

where $\pi$(x) is the prime counting function. The prime counting function is the number of primes less than or equal to x.

The numbers 2, 11, 17, 29, 41 are first few Ramanujan primes. In other words:

Ramanujan primes are the integers Rn that are the smallest to satisfy the condition

$\pi(x) - \pi(x/2)$ ≥ n, for all x ≥ Rn
This short article about mathematics can be made longer. You can help Wikipedia by .
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 3, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8941740393638611, "perplexity_flag": "middle"}