Defining Upper and Lower Bounding Functions of li(x) with O(x(x)) Error Using Truncated Asymptotic Series
Abstract
We introduce approximation functions of li(x) for all x e: (1) liω,α(x) = x(x)( αm!m(x) + Σk=0m-1k!k(x) ), and (2) liω,β=x(x)( βm!m(x) + Σk=0m-1k!k(x) ) with 0 < ω < 1 a real number, α ∈ \ 0, (x) \, m = (x) , β ∈ \ (x), 1 \, m = (x) , and < the solutions of (1-()) = ω. Since the error of approximating li(x) using Stieltjes asymptotic series li*(x) = x(x)Σk=0n-1k!k(x) + ((x)-n)xn!n+1(x), with n = (x) for all x e, satisfies |(x)| = |li(x)-li*(x)| 1.265692883422…, by using Stirling's approximation and some facts about (x) and floor functions, we show that 0(x) = li(x) - li1/2,0(x), (x) = li(x) - li1/2,(x)(x), (x) = li(x) - li1/2,(x)(x), and 1(x) = li1/2,1(x) - li(x) belong to O(x(x)). Moreover, we conjecture that li0(x) π(x) li1(x) and li(x) π(x) li(x) for all x e, here π(x) is the prime counting function and we show that if one of those conjectures is true then the Riemann Hypothesis is true.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.