Related papers: Contradictions in some primes conjectures

For any positive integer r, let pi_{2r}(x) denote the number of prime pairs (p, p+2r) with p not exceeding (large) x. According to the prime-pair conjecture of Hardy and Littlewood, pi_{2r}(x) should be asymptotic to 2C_{2r}li_2(x) with an…

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

Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^{\alpha}d_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log…

Consider a system \Psi of non-constant affine-linear forms \psi_1,...,\psi_t: Z^d -> Z, no two of which are linearly dependent. Let N be a large integer, and let K be a convex subset of [-N,N]^d. A famous and difficult open conjecture of…

We use the Bateman--Horn Conjecture from number theory to give strong evidence of a positive answer to Peter Neumann's question, whether there are infinitely many simple groups of order a product of six primes. (Those with fewer than six…

Under Cram\'er's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$.…

In 1976, Gallagher showed that the Hardy--Littlewood conjectures on prime $k$-tuples imply that the distribution of primes in log-size intervals is Poissonian. He did so by computing average values of the singular series constants over…

The variance of primes in short intervals relates to the Riemann Hypothesis, Montgomery's Pair Correlation Conjecture and the Hardy--Littlewood Conjecture. In regards to its asymptotics, very little is known unconditionally. We study the…

We prove that a positive proportion of the intervals of any fixed scalar multiple of $\log(X)$ in the dyadic interval $[X,2X]$ contain a prime number. We also show that a positive proportion of the congruence classes modulo $q$ contain a…

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…

Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…

A celebrated conjecture of Hardy and Littlewood provides with an asymptotic formula for the counting function of the twin primes. We give an unconditional proof of such a formula by means of a finite Ramanujan expansion of the counting…

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 world of primes has many gaps between evidence and theorems. Here, we review Legendre's conjecture on primes between consecutive squares and recent progress on the weaker question of primes between consecutive larger powers. Assuming…

We address the question of the infinitude of twin and cousin prime pairs from a probabilistic perspective. Our approach partitions the set of integer numbers greater than $2$ in finite intervals of the form $[p_{n-1}^2,p_n^2)$, $p_{n-1}$…

We prove that analogues of the Hardy-Littlewood generalised twin prime conjecture for almost primes hold on average. Our main theorem establishes an asymptotic formula for the number of integers $n=p_1p_2 \leq X$ such that $n+h$ is a…

Using evaluations of the difference between consecutive primes we develop another way of estimating of the number of primes in the interval $(n, 2n)$. We also discuss the ultra Cramer conjecture, $p_{n+1} - p_n = O(log^{1+\epsilon}p_n)$…

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…