Asymptotic error terms in Bonse-type inequalities
Diego Marques, Pavel Trojovsky

TL;DR
This paper confirms a conjecture related to Bonse-type inequalities by analyzing the asymptotic behavior of error terms, providing precise thresholds for their positivity, and establishing bounds under various hypotheses.
Contribution
It proves the conjecture about the inequality for x=0.1, derives the asymptotic expansion of the error term, and determines the minimal n for positivity, including bounds under the Riemann Hypothesis.
Findings
Confirmed the conjecture for x=0.1 at n=24,154,953
Derived asymptotic expansion showing positivity for large n when x > -2
Established effective bounds for the minimal n under unconditional and Riemann Hypothesis assumptions
Abstract
Let denote the -th prime. In 2000, Panaitopol established the inequality for all , where is the prime counting function. In 2021, Yang and Liao refined this by introducing the exponent , proving the inequality holds for and . In 2022, Marques and Trojovsk\'y extended this to for and conjectured its validity for when . This paper confirms the conjecture by analyzing the error term . Also, we derive the asymptotic expansion to demonstrating that it is positive for all sufficiently large when . For each , we identify a minimal integer such that for all , precisely…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Mathematical Inequalities and Applications · Advanced Harmonic Analysis Research
