Defining Upper and Lower Bounding Functions of $li(x)$ with $\displaystyle O\left(\sqrt{\frac{x}{\log(x)}}\right)$ Error Using Truncated Asymptotic Series
We introduce approximation functions of li(x) for all x≥e: (1) liω,α(x)=log(x)x(αlogm(x)m!+k=0∑m−1logk(x)k!), and (2) liω,β=log(x)x(βlogm(x)m!+k=0∑m−1logk(x)k!) with 0<ω<1 a real number, α∈{0,κlog(x)}, m=⌊κlog(x)⌋, β∈{κlog(x),1}, m=⌊κlog(x)⌋, and κ<κ the solutions of κ(1−log(κ))=ω. Since the error of approximating li(x) using Stieltjes asymptotic series li∗(x)=log(x)xk=0∑n−1logk(x)k!+(log(x)−n)logn+1(x)xn!, with n=⌊log(x)⌋ for all x≥e, satisfies ∣ε(x)∣=∣li(x)−li∗(x)∣≤1.265692883422…, by using Stirling's approximation and some facts about log(x) and floor functions, we show that ε0(x)=li(x)−li1/2,0(x), ε(x)=li(x)−li1/2,κlog(x)(x), ε(x)=li(x)−li1/2,κlog(x)(x), and ε1(x)=li1/2,1(x)−li(x) belong to O(log(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.