Related papers: New bounds for $\psi(x)$
In this paper we obtain some new estimates for the number of large values of Dirichlet polynomials. Our results imply new zero density estimates for the Riemann zeta function which give a small improvement on results of Bourgain and Jutila.
We confirm Chebyshev's observation that primes are strikingly more abundant in non-square residue classes modulo a fixed integer under the Generalized Riemann Hypothesis (GRH) by proving a (natural) density $1$ statement for prime counting…
We obtain optimal lower bounds for moments of theta functions. On the other hand, we also get new upper bounds on individual theta values and moments of theta functions on average over primes. The upper bounds are based on bounds of…
A Chebyshev-type quadrature for a probability measure sigma is a distribution which is uniform on n points and has the same first k moments as sigma. We give an upper bound for the minimal n required to achieve a given degree k, for sigma…
The recent technique for estimating lower bounds of the prime counting function $\pi(x)=#\{p \leq x: p\text{ prime}\}$ by means of the irrationality measures $\mu(\zeta(s)) \geq 2$ of special values of the zeta function claims that $\pi(x)…
This paper contains new explicit upper bounds for the number of zeroes of Dirichlet L-functions and Dedekind zeta-functions in rectangles.
For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…
In this paper, we shall study the stellar work of Norwegian mathematician Selberg and Hungarian mathematician Erd\H{o}s in providing an Elementary proof of the well-known \textit{Prime Number Theorem}. In addition to introducing ourselves…
The goal of this paper is to give a relatively simple proof of some known zero density estimates for Riemann zeta function which are sufficiently strong to break the density hypothesis in a nontrivial part of the critical strip. Apart from…
Let $N$ be the counting function of a Beurling generalized number system and let $\pi$ be the counting function of its primes. We show that the $L^{1}$-condition $$ \int_{1}^{\infty}|\frac{N(x)-ax}{x}|\frac{\mathrm{d}x}{x}<\infty $$ and the…
The bounds for the ratios of first and second kind modified Bessel functions of consecutive orders are important quantities appearing in a large number of scientific applications. We obtain new bounds which are accurate in a large region of…
The aim of this paper is to improve the upper bound for the exceptional zeroes $\beta_0$ of Dirichlet $L$-functions. We do this by improving on explicit estimate for $L'(\sigma, \chi)$ for $\sigma$ close to unity.
Several results are obtained concerning multiplicities of zeros of the Riemann zeta-function $\zeta(s)$. They include upper bounds for multiplicities, showing that zeros with large multiplicities have to lie to the left of the line $\sigma…
The prime-counting function $\pi(x)$ which computes the number of primes smaller or equal to a given real number has a long-standing interest in number theory. The present manuscript proposes a method to compute $\pi(x)$ with time…
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…
Consider the Mills ratio $f(x)=\big(1-\Phi(x)\big)/\phi(x), \, x\ge 0$, where $\phi$ is the density function of the standard Gaussian law and $\Phi$ its cumulative distribution.We introduce a general procedure to approximate $f$ on the…
Let $\pi S(t)$ denote the argument of the Riemann zeta-function at the point $s=\tfrac12+it$. Assuming the Riemann hypothesis, we give a new and simple proof of the sharpest known bound for $S(t)$. We discuss a generalization of this bound…
In this work, a generalization of Chebyshev functional is presented. New inequalities of Gruss type via Pompeiu's mean value theorem are established. Improvements of some old inequalities are proved. A generalization of pre-Gruss inequality…
The original Gelfond-Schnirelman method, proposed in 1936, uses polynomials with integer coefficients and small norms on $[0,1]$ to give a Chebyshev-type lower bound in prime number theory. We study a generalization of this method for…
For a real-valued measurable function $f$ and a nonnegative, nondecreasing function $\phi$, we first obtain a Chebyshev type inequality which provides an upper bound for $\displaystyle \phi(\lambda_{1}) \mu(\{x \in \Omega : f(x) \geq…