The Ramanujan nearest-integer conjecture for the prime-counting function
The Ramanujan nearest-integer conjecture for the prime-counting function
Let be the Ramanujan set of values for which is the nearest integer to
where is the prime-counting function, is the Möbius function, and is the logarithmic integral. Ramanujan's conjecture. The set contains arbitrarily large numbers. This interprets Ramanujan's claim that his asymptotic formula is generally equal to the prime-counting function up to the nearest integer. The source does not give evidence of a resolution.
Sources & referencesView supporting material
Primary source
Ricardo Pérez-Marco, “Notes on the Riemann Hypothesis”, arXiv:1707.01770 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.