2000 character limit reached
Counting Primes Rationally And Irrationally
Published 29 Jul 2019 in math.GM | (1907.12979v2)
Abstract: The recent technique for estimating lower bounds of the prime counting function $\pi(x)=#{p \leq x: p\text{ prime}}$ by means of the irrationality measures $\mu(\zeta(s)) \geq 2$ of special values of the zeta function claims that $\pi(x) \gg \log \log x/\log \log \log x$. This note improves the lower bound to $\pi(x) \gg \log x$, and extends the analysis to the irrationality measures $\mu(\zeta(s)) \geq 1$ for rational ratios of zeta functions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.