English
Related papers

Related papers: Close encounters among the primes

200 papers

In this paper, we make some conjectures on prime numbers that are sharper than those found in the current literature. First we describe our studies on Legendre's Conjecture which is still unsolved. Next, we show that Brocard's Conjecture…

Number Theory · Mathematics 2009-06-02 Adway Mitra , Goutam Paul , Ushnish Sarkar

In this paper, we study the gaps between primes in Beatty sequences following the methods in the recent breakthrough of J. Maynard.

Number Theory · Mathematics 2015-09-24 Roger C. Baker , Liangyi Zhao

The scientific world is becoming more open to the public and fellow researchers. Open access publishing is becoming accepted, even if some publishers are resisting. The next step is the open code and data paradigm, which was briefly…

Signal Processing · Electrical Eng. & Systems 2019-05-03 Emil Björnson

In the present work the existence of some patterns of primes is shown which generalize the celebrated result of Green and Tao according to which there are arbitrarily long arithmetic progressions in the sequence of primes

Number Theory · Mathematics 2010-04-08 Janos Pintz

This version of the paper corrects an inaccuracy in the proof of Theorem 2.9 in the published version. The main results remain unchanged.

Number Theory · Mathematics 2023-01-02 Florin P. Boca , Alexandru Zaharescu

In this work we prove that the set of the difference of primes is a $\Delta_r^*$-set. The work is based on the recent dramatic new developments in the study of bounded gaps between primes, reached by Zhang, Maynard and Tao.

Number Theory · Mathematics 2015-09-10 Wen Huang , XiaoSheng Wu

This 1964 paper developed as an off-shoot to the foundational query: Do we discover the natural numbers (Platonically), or do we construct them linguistically? The paper also assumes computational significance in the light of Agrawal, Kayal…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

In this paper we investigate the recent advances by Zhang, Maynard and Pintz towards Polignac's conjecture and give some new results concerning the relationship between Polignac numbers and arithmetic progressions.

Number Theory · Mathematics 2014-04-16 Stijn Hanson

Let $r \ge 2$ be an integer. We adapt the Maynard-Tao sieve to produce the asymptotically best-known bounded gaps between products of $r$ distinct primes. Our result applies to positive-density subsets of the primes that satisfy certain…

Number Theory · Mathematics 2018-03-14 Yang P. Liu , Peter S. Park , Zhuo Qun Song

In this paper, we apply the method of Maynard and Tao to the set of products of two distinct primes (E2-numbers). We obtain several results on the distribution of E2-numbers and primes. Among others, the result of Goldston, Pintz, Yildirim…

Number Theory · Mathematics 2018-07-10 Keiju Sono

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…

Number Theory · Mathematics 2014-07-09 Janos Pintz

We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…

Number Theory · Mathematics 2025-07-01 Alexandru Pascadi

We show a smoothed version of Goldston-Pintz-Yildirim's sifting argument to detect small gaps between primes, which has a higly flexible error term. Our argument is applicable to high dimensional Selberg sieve situations as well, although…

Number Theory · Mathematics 2014-02-26 Yoichi Motohashi , Janos Pintz

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

Number Theory · Mathematics 2022-11-18 Jared Duker Lichtman

The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $n$ greater than $5$ is the sum of three primes. The present paper proves this conjecture. Both the ternary Goldbach conjecture and the binary, or…

Number Theory · Mathematics 2014-01-20 H. A. Helfgott

In this article we use techniques of proof mining to analyse a result, due to Yonghong Yao and Muhammad Aslam Noor, concerning the strong convergence of a generalized proximal point algorithm which involves multiple parameters. Yao and…

Logic · Mathematics 2021-01-13 Bruno Dinis , Pedro Pinto

Let $m \in \mathbb{N}$ be large. We show that there exist infinitely many primes $q_{1}< \cdot\cdot\cdot < q_{m+1}$ such that \[ q_{m+1}-q_{1}=O(e^{7.63m}) \] and $q_{j}+2$ has at most \[ \frac{7.36m}{\log 2} + \frac{4\log m}{\log 2} + 21…

Number Theory · Mathematics 2025-07-17 Bin Chen

We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.

Number Theory · Mathematics 2007-06-11 Vladimir Shevelev

The ternary Goldbach conjecture, or three-primes problem, states that every odd number $n$ greater than $5$ can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolved until now, in spite of great progress in…

Number Theory · Mathematics 2014-04-15 Harald Andrés Helfgott

In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the…

Number Theory · Mathematics 2022-06-24 Stephan Baier , Sudhir Pujahari