Related papers: Counting Primes Rationally And Irrationally

We provide explicit upper bounds of the order $\log t/\log\log t$ for $|\zeta'(s)/\zeta(s)|$ and $|1/\zeta(s)|$ when $\sigma$ is close to $1$. These improve existing bounds for $\zeta(s)$ on the $1$-line.

In this paper, we establish new bounds for classical prime-counting functions. All of our bounds are explicit and assume the Riemann Hypothesis. First, we prove that $|\psi(x) - x|$ and $|\vartheta(x) - x|$ are bounded from above by…

For real $\xi$ we consider the irrationality measure function $\psi_\xi(t) = \min_{1\leqslant q \leqslant t, q\in\mathbb{Z}} || q\xi ||$, where $||\cdot||$ - distance to the nearest integer. We prove that in the case…

In this article, we improve the recent work of Hasanalizade, Shen, and Wong by establishing \[ \left| N (T) - \frac{T}{ 2 \pi} \log \left( \frac{T}{2\pi e}\right) \right|\le 0.10076\log T+0.24460\log\log T+8.08344, \] for every $T\ge e$,…

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

In this paper we give new estimates for integrals involving some arithmetic functions defined over prime numbers. The main focus here is on the prime counting function $\pi(x)$ and the Chebyshev $\vartheta$-function. Some of these estimates…

Some computations made about the Riemann Hypothesis and in particular, the verification that zeroes of zeta belong on the critical line and the extension of zero-free region are useful to get better effective estimates of number theory…

In a spirit of Ap\'ery's proof of the irrationality of $\zeta(3)$, we construct a sequence $p_n/q_n$ of rational approximations to the $2$-adic zeta value $\zeta_2(5)$ which satisfy $0 < |\zeta_2(5)-p_n/q_n|_2 <…

We prove non-trivial lower bounds for sums of type $\sum_{p\sim P}g(\gamma\Log p)$, where $g$ is a non-negative $2\pi$-periodical function and $\gamma$ is a given parameter. As an application we prove that $\zeta(1+it)^{\pm1}\ll\Log\Log…

In this paper we first establish new explicit estimates for Chebyshev's $\vartheta$-function. Applying these new estimates, we derive new upper and lower bounds for some functions defined over the prime numbers, for instance the prime…

We show how one can use Hermite-Pad\'{e} approximation and little $q$-Jacobi polynomials to construct rational approximants for $\zeta_q(2)$. These numbers are $q$-analogues of the well known $\zeta(2)$. Here $q=\frac{1}{p}$, with $p$ an…

The irrationality exponent $\mu(t)$ of an irrational number t, defined using the irrationality measure $1/q^\mu$, distinguishes among non-Liouville numbers and is infinite for Liouville numbers. Using the irrationality measure $1/\beta^q$,…

In this paper we use refined approximations for Chebyshev's $\vartheta$-function to establish new explicit estimates for the prime counting function $\pi(x)$, which improve the current best estimates for large values of $x$. As an…

In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…

The function $\epsilon(x)=\mbox{li}(x)-\pi(x)$ is known to be positive up to the (very large) Skewes' number. Besides, according to Robin's work, the functions $\epsilon_{\theta}(x)=\mbox{li}[\theta(x)]-\pi(x)$ and…

A famous theorem of Zudilin states that at least one of the Riemann zeta values $\zeta(5), \zeta(7), \zeta(9), \zeta(11)$ is irrational. In this paper, we establish the $p$-adic analogue of Zudilin's theorem. As a weaker form of our result,…

This research article provides an unconditional proof of an inequality proposed by Srinivasa Ramanujan involving the Prime Counting Function $\pi(x)$, \begin{align*} (\pi(x))^{2}<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right) \end{align*} for…

We describe a rigorous implementation of the Lagarias and Odlyzko Analytic Method to evaluate the prime counting function and its use to compute unconditionally the number of primes less than $10^{24}$.

In this paper we introduce the prime index function \begin{align}\iota(n)=(-1)^{\pi(n)},\nonumber \end{align} where $\pi(n)$ is the prime counting function. We study some elementary properties and theories associated with the partial sums…

This article considers the error term of the primes counting function. It applies some recent results on the densities of prime numbers in short intervals to derive an improvement of the error term from subexponential size to fractional…