Related papers: On the Second Hardy-Littlewood Conjecture

This note discusses the existence of prime numbers in short intervals. An unconditional elementary argument seems to prove the existence of primes in the short intervals [x, x + y], where y >= x^(1/2)(log x)^e, e > 0, and a sufficiently…

In this paper, we prove the twin prime conjecture showing that \begin{align} \sum \limits_{\substack{p\leq x\\p,p+2\in \mathbb{P}}}1\geq (1+o(1))\frac{x}{2\mathcal{C}\log^2 x}\nonumber \end{align} where $\mathcal{C}:=\mathcal{C}(2)>0$ fixed…

Starting from the first Hardy-Littlewood conjecture some topics will be covered: an empirical approach to the distribution of the twin primes in classes mod(10) and a simplified proof of the Bruns theorem . Finally, it will be explored an…

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…

Let $A\subseteq [N]$ be such that for any pair of distinct subsets $B,C\subset A$, the products $\prod_{b\in B}b$ and $\prod_{c\in C}c$ are distinct. We prove that $|A|\leq \pi(N)+\pi(N^{1/2})+o(\pi(N^{1/2}))$, where $\pi$ is the prime…

In this article, we present a new subadditivity behavior of convex and concave functions, when applied to Hilbert space operators. For example, under suitable assumptions on the spectrum of the positive operators $A$ and $B$, we prove that…

We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers…

We provide approximations to the prime counting function by various discretized versions of the logarithmic integral function, expressed solely in terms of the harmonic numbers. We demonstrate with explicit error bounds that these…

The Hardy--Littlewood inequalities for $m$-linear forms on $\ell_{p}$ spaces are known just for $p>m$. The critical case $p=m$ was overlooked for obvious technical reasons and, up to now, the only known estimate is the trivial one. In this…

We construct a Beurling generalized number system satisfying the Riemann hypothesis and whose integer counting function displays extremal oscillation in the following sense. The prime counting function of this number system satisfies…

We prove a sharp integral inequality valid for non-negative functions defined on $[0,1]$, with given $L^1$ norm. This is in fact a generalization of the well known integral Hardy inequality. We prove it as a consequence of the respective…

The well-known necessary and sufficient criteria for the Riemann hypothesis of M. Riesz and Hardy-Littlewood, based on the order of growth at infinity along the positive real axis of certain entire functions, are here imbedded in a general…

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].

Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results…

We give an explicit version of Brun-Titchmarsh theorem applicable for arbitrary moduli and arbitrary intervals. For example, we show that $\pi(x+y; k, a)-\pi(x; k, a)<2y/(\varphi(k)(\log (y/k)+0.8601))$ for any relatively prime positive…

Let $I\subseteq{\mathbb{R_+}}$ be a non empty and non singleton interval where ${\mathbb{R_+}}$ denotes the set of all non negative numbers. A function $\Phi: I\to {\mathbb{R_+}}$ is said to be subadditive if for any $x,y$ and $x+y\in I$,…

In this paper, we give a new upper bound for the number $N_{\mathcal{R}}$ which is defined to be the smallest positive integer such that a certain inequality due to Ramanujan involving the prime counting function $\pi(x)$ holds for every $x…

For any $m = 3 \left( 2n + 1 \right) with \ n \in \mathbb{N^*} ,$ the prime counting function $\pi(m) = 4 + \left \vert A_4(m) \right \vert + 2 \left \vert A_6(m) \right \vert $ where $A_6(m) $ and $ A_4(m) $ are the sets of Twin Primes and…

Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural…

In this work we proof the following theorem which is, in addition to someother lemmas, our main result:\noindent \textbf{theorem}. Let$\ X=\{ ( x\_{1}\text{, }%t\_{1}) \text{, }( x\_{2}\text{, }t\_{2}) \text{, ..., }(x\_{n}\text{,…