Related papers: Primes in intervals of bounded length
By a sphere-packing argument, we show that there are infinitely many pairs of primes that are close to each other for some metrics on the integers. In particular, for any numeration basis $q$, we show that there are infinitely many pairs of…
We use Maynard's methods to show that there are bounded gaps between primes in the sequence $\{\lfloor n\alpha\rfloor\}$, where $\alpha$ is an irrational number of finite type. In addition, given a superlinear function $f$ satisfying some…
In the proposed matrix primes, through which one can readily generate a sequence of primes. The paper also proposes a number of theorems proved by which an infinite number of prime numbers twins
The twin primes conjecture is a very old problem. Tacitly it is supposed that the primes it deals with are finite. In the present paper we consider three problems that are not related to finite primes but deal with infinite integers. The…
It is proven that there are infinitely prime pairs whose difference is no greater than 84. In proving that result, a new sieve weight is constructed. The new idea is to construct the largest sieve support which admits the use of the…
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 earlier considered our sequence A166944 in [4] we prove three statements of its connection with twin primes. We also give a sufficient condition for the infinity of twin primes and pose several new conjectures; among them we propose a…
The Polignac's Conjecture, first formulated by Alphonse de Polignac in 1849, asserts that, for any even number M, there exist infinitely many couples of prime numbers P, P+M. When M = 2, this reduces to the Twin Primes Conjecture. Despite…
This is an exposition of recent developments in the theory of bounded differences between primes. Readers are expected to be beginners of analytic number theory. The present text is a substantially improved and augmented version of the one…
It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…
In a recent joint work with D.A. Goldston and C.Y. Yildirim we just missed by a hairbreadth a proof that bounded gaps between primes occur infinitely often. In the present work it is shown that adding to the primes a much thinner set,…
We show that there are infinitely many primes $p$ such that not only does $p + 2$ have at most two prime factors, but $p + 6$ also has a bounded number of prime divisors. This refines the well known result of Chen.
Let $S_{(x,y]} = \left\{\frac{p_n}{p_{n+1}-2} :~ n\in I \right\}$, where $I = \left\{n :~ x<p_n \le y \right\}$, $p_n$ is the $n$-th prime and $x, y \in \mathbb{R}_{>0}$. If $M_\alpha(x,y)$ denotes the $\alpha$-power mean of the elements of…
For any $m \geq 1$, let $H_m$ denote the quantity $\liminf_{n \to \infty} (p_{n+m}-p_n)$. A celebrated recent result of Zhang showed the finiteness of $H_1$, with the explicit bound $H_1 \leq 70000000$. This was then improved by us (the…
There is extensive numerical support for the prime-pair conjecture (PPC) of Hardy and Littlewood (1923) on the asymptotic behavior of pi_{2r}(x), the number of prime pairs (p,p+2r) with p not exceeding x. However, it is still not known…
In 1845, Bertrand conjectured that twice any prime strictly exceeds the next prime. Tchebichef proved Bertrand's postulate in 1850. In 1934, Ishikawa proved a stronger result: the sum of any two consecutive primes strictly exceeds the next…
Goldston, Pintz and Y\i ld\i r\i m have shown that if the primes have `level of distribution' $\theta$ for some $\theta>1/2$ then there exists a constant $C(\theta)$, such that there are infinitely many integers $n$ for which the interval…
In the present work we prove a common generalization of Maynard-Tao's recent result about consecutive bounded gaps between primes and on the Erd\H{o}s-Rankin bound about large gaps between consecutive primes. The work answers in a strong…
By Maynard's theorem and the subsequent improvements by the Polymath Project, there exists a positive integer $b\leq 246$ such that there are infinitely many primes $p$ such that $p+b$ is also prime. Let $P_1,...,P_t\in \mathbb{Z}[y]$ with…
We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…