Origins and definitionEdit
Ramanujan's result at the end of the paper was:
where (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
- ≥ n, for all x ≥ Rn