Related papers: Inequalities For The Primes Counting Function

We show by an inclusion-exclusion argument that the prime $k$-tuple conjecture of Hardy and Littlewood provides an asymptotic formula for the number of consecutive prime numbers which are a specified distance apart. This refines one aspect…

We adopt a physically motivated empirical approach to the characterisation of the distributions of twin and triplet primes within the set of primes, rather than in the set of all natural numbers. Remarkably, the occurrences of twins or…

The Hardy--Littlewood inequality for $m$-linear forms on $\ell _{p}$ spaces and $m<p\leq 2m$ asserts that \begin{equation*} \left( \sum_{j_{1},...,j_{m}=1}^{\infty }\left\vert T\left( e_{j_{1}},\ldots ,e_{j_{m}}\right) \right\vert…

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

Let $p_n$ denote the $n$-th prime. In 2000, Panaitopol established the inequality $p_1 \cdots p_n > p_{n+1}^{n - \pi(n)}$ for all $n \geq 2$, where $\pi(x)$ is the prime counting function. In 2021, Yang and Liao refined this by introducing…

We establish the weighted fractional Orlicz-Hardy inequalities for various Orlicz functions. Further, we identify the critical cases for each Orlicz function and prove the weighted fractional Orlicz-Hardy inequalities with logarithmic…

We denote by $\pi\left( x\right) $ the usual prime counting function and let $li\left( x\right) $ the logarithmic integral of $x$. In 1966, R.S. Lehman came up with a new approach and an effective method for finding an upper bound where it…

In this paper, we derive a generalized multiplicative Hardy-Littlewood-Polya type inequality, as well as several related additive inequalities, for functions of operators in Hilbert spaces. In addition, we find the modulus of continuity of…

We survey some past conditional results on the distribution of large differences between consecutive primes and examine how the Hardy-Littlewood prime k-tuples conjecture can be applied to this question.

We consider estimates of Hardy and Littlewood for norms of operators on sequence spaces, and we apply a factorization result of Maurey to obtain improved estimates and simplified proofs for the special case of a positive operator.

We improve the classical discrete Hardy inequality \begin{equation*}\label{1} \sum _{{n=1}}^{\infty }a_{n}^{2}\geq \left({\frac {1}{2}}\right)^{2} \sum _{{n=1}}^{\infty }\left({\frac {a_{1}+a_{2}+\cdots +a_{n}}{n}}\right)^{2},…

We improve the classical discrete Hardy inequality for $ 1<p<\infty $ for functions on the natural numbers. For integer values of $ p $ the Hardy weight is an absolutely monotonic function.

Assume that $ y < N$ are integers, and that $ (b,y) =1$. Define an average along the primes in a progression of diameter $ y$, given by integer $ (b,y)=1 $. \begin{align*} A_{N,y,b} := \frac{\phi (y)}{N} \sum _{\substack{n <N\\n\equiv…

For a real number $k$, define $\pi_k(x) = \sum_{p\le x} p^k$. When $k>0$, we prove that $$ \pi_k(x) - \pi(x^{k+1}) = \Omega_{\pm}\left(\frac{x^{\frac12+k}}{\log x} \log\log\log x\right) $$ as $x\to\infty$, and we prove a similar result when…

Let $J$ denote the interval either $(0,1]$ or $ [1, \infty)$. A positive function $f$ on $J$ with $f(1) =1$ is reffered to as a Weierstrass function if it fulfils the double inequality for $x,y \in J$: $$f(x) + f(y) -1 \leq f(xy) \leq…

The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…

We examine the prime gaps using a statistical approach. It is first shown that the Andrica's conjecture is true for half or more cases. Using the arguments of averages, it is further shown that Andrica's conjecture is true. We further…

We obtain a lower bound for \[ \#\{x/2< p_{n}\leq x:\ p_n \equiv\ldots\equiv p_{n+m}\equiv a\text{ (mod $q$)},\ p_{n+m} - p_{n}\leq y\}, \] where $p_{n}$ is the $n^{\text{th}}$ prime.

We present a new lower bound for Euler's beta function, $B(x,y)$, which states that the inequality \begin{equation*} B(x,y)>\frac{x+y}{xy}\left(1-\frac{2xy}{x+y+1}\right) \end{equation*} holds on $(0,1]\times(0,1]$, which improves a lower…

This article provides new asymptotic results for the summatory Mobius function $\sum_{p \leq x} \mu(p+a) =O \left (x(\log x)^{-c} \right )$ and the summatory Liouville function $\sum_{p \leq x} \lambda(p+a) =O \left (x(\log x)^{-c} \right…