Related papers: New bounds for $\psi(x)$

Chebyshev presented a conjecture after observing the apparent bias towards primes congruent to $3\pmod 4$. His conjecture is equivalent to a version of the Generalised Riemann Hypothesis. Fujii strengthened this conjecture; we strengthen it…

In this paper we investigate analytic inequalities related to a conjecture of Henry involving the difference between the Riemann zeta function and the digamma function. By treating $\zeta(s)-\psi(1-s)$ as a unified analytic object, we…

This paper proposes new bounds for Marcum Q-function, which prove extremely tight and outperform all the bounds previously proposed in the literature. What is more, the proposed bounds are good and stable both for large values and small…

Let $\zeta_K(s)$ denote the Dedekind zeta-function associated to a number field $K$. In this paper, we give an effective upper bound for the height of first non-trivial zero other than $1/2$ of $\zeta_K(s)$ under the generalized Riemann…

In this paper, we obtain uniform bounds for a number of expressions that involve derivatives and integrals of modified Bessel functions. These uniform bounds are motivated by the need to bound such expressions in the study of variance-gamma…

The prime counting function inequality $\pi(x+y) < \pi(x)+\pi(y)$, which is known as Hardy-Littlewood conjecture, has been established for a variety of cases such as $ \delta x \leq y \leq x$, where $0< \delta \leq 1$, and $x \leq y\leq x…

The article discusses the representation of discrete functions defined in an analytic form without the use of approximations, namely the Heaviside function, identity function, the Dirac delta function and the prime-counting function. Also…

V. Fock [7] introduced an interesting function $\psi(x)$, $x \in {\mathbb R}$ related to Markov numbers. We explain its relation to Federer-Gromov's stable norm and Mather's $\beta$-function, and use this to study its properties. We prove…

Of what use are the zeros of the Riemann zeta function? We can use sums involving zeta zeros to count the primes up to $x$. Perron's formula leads to sums over zeta zeros that can count the squarefree integers up to $x$, or tally Euler's…

We show that Hal\'{a}sz's theorem holds for Beurling numbers under the following two mild hypotheses on the generalized number system: existence of a positive density for the generalized integers and a Chebyshev upper bound for the…

We obtain almost sure bounds for the weighted sum $\sum_{n \leq t} \frac{f(n)}{\sqrt{n}}$, where $f(n)$ is a Steinhaus random multiplicative function. Specifically, we obtain the bounds predicted by exponentiating the law of the iterated…

Recently, Dixit et al. established a very elegant generalization of Hardy's Theorem concerning the infinitude of zeros that the Riemann zeta function possesses at its critical line. By introducing a general transformation formula for the…

In the paper, by directly verifying an inequality which gives a lower bound for the first order modified Bessel function of the first kind, the authors supply a new proof for the complete monotonicity of a difference between the exponential…

We consider a smooth counting function of the scaled zeros of the Riemann zeta function, around height T. We show that the first few moments tend to the Gaussian moments, with the exact number depending on the statistic considered.

In this note we describe some results concerning upper and lower bounds for the Jensen functional. We use several known and new results to shed light on the concepts of superterzatic functions.

Assuming the Riemann Hypothesis, we obtain an upper bound for the 2k-th moment of the derivative of the Riemann zeta-function averaged over the non-trivial zeros of $\zeta(s)$ for every positive integer k. Our bounds are nearly as sharp as…

Some new bounds for the Chebychev functional of a pair of vectors in inner product spaces are pointed out. Reverses for the celebrated Jensen's inequality for convex functions defined on inner product spaces are given as well.

We use a coin flipping model for the random partition and Chebyshev's inequality to prove the lower bound $\lim \frac{\log p(n)}{\sqrt{n}} \ge C$ for the number of partitions $p(n)$ of $n$, where $C$ is an explicit constant.

I define Goldbach counting function with N > 0 and square-free P > 0. Decomposition of this function is discovered and deduction formula is found. I propose a hypothesis on upper bound of Goldbach counting function and prove that Goldbach…

In this paper we define the polygamma functions $\psi^{(n)}(x)$ for negative integers by using neutrix calculus.