Related papers: Inequalities For The Primes Counting Function

The Hardy--Littlewood inequalities for $m$-linear forms have their origin with the seminal paper of Hardy and Littlewood (Q.J. Math, 1934). Nowadays it has been extensively investigated and many authors are looking for the optimal estimates…

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…

For the functions $f$, which can be represented in the form of the convolution $f(x)=\frac{a_{0}}{2}+\frac{1}{\pi}\int\limits_{-\pi}^{\pi}\sum\limits_{k=1}^{\infty}e^{-\alpha k^{r}}\cos(kt-\frac{\beta\pi}{2})\varphi(x-t)dt$,…

In this paper we characterize the validity of the Hardy-type inequality \begin{equation*} \left\|\left\|\int_s^{\infty}h(z)dz\right\|_{p,u,(0,t)}\right\|_{q,w,\infty}\leq c \,\|h\|_{1,v,\infty} \end{equation*} where $0<p< \infty$, $0<q\leq…

The goal of this paper is to describe an elementary combinatorial heuristic that predicts Hardy and Littlewood's extended Goldbach's conjecture. We examine common features of other heuristics in additive prime number theory, such as…

A Prime Difference Champion (PDC) for primes up to $x$ is defined to be any element of the set of one or more differences that occur most frequently among all positive differences between primes $\le x$. Assuming an appropriate form of the…

This is a survey article on the Hardy-Littlewood conjecture about primes in quadratic progressions. We recount the history and quote some results approximating this hitherto unresolved conjecture.

The Hardy Inequality (HI) for potentials with countably many singularities of the form $V=\sum_{k\in \mathbf{Z}}\frac{1}{|x-a_k|^2}$ is not a trivial issue. In principle, the more singular poles are, the less the Hardy constant is: it is…

New proofs of the classical Hermite-Hadamard inequality are presented and several applications are given, including Hadamard-type inequalities for the functions, whose derivatives have inflection points or whose derivatives are convex.…

All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…

The celebrated Artin conjecture on primitive roots asserts that given any integer $g$ which is neither $-1$ nor a perfect square, there is an explicit constant $A(g)>0$ such that the number $\Pi(x;g)$ of primes $p\le x$ for which $g$ is a…

Let $a_0\in\{0,\dots,9\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their decimal expansion. The proof is an application of the Hardy-Littlewood circle method to a binary problem, and rests on…

In this paper we discuss a method to express the Prime counting function as a "sum" over Non-trivial zeros of Riemann Zeta function, using techniques from Analytic Number Theory, also we apply our results to the sum over primes of any…

This paper introduces a new method to find the next prime number after a given prime ${P}$. The proposed method is used to derive a system of inequalities, that serve as constraints which should be satisfied by all primes whose successor is…

An interesting episode in the history of the prime number theorem concerns a formula proposed by Legendre for counting the primes below a given bound. We point out that arithmetic bias likely played an important role in arriving at that…

Instead of a strong quantitative form of the Hardy-Littlewood prime $k$-tuple conjecture, one can assume an average form of it and still obtains the same distribution result on $\psi(x+h) - \psi(x)$ by Montgomery and Soundararajan [1].

We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like…

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…

Hooley conjectured that the variance V(x;q) of the distribution of primes up to x in the arithmetic progressions modulo q is asymptotically x log q, in some unspecified range of q\leq x. On average over 1\leq q \leq Q, this conjecture is…

In this paper we give alternate proofs of some well-known matrix inequalities. In particular, we show that under certain conditions the inequality holds \begin{align}\sum \limits_{\lambda_i\in \mathrm{Spec}(ab^{T})}\mathrm{min}\{\log…