English
Related papers

Related papers: On smooth gaps between primes using the Maynard-Ta…

200 papers

A computational problem exhibits a "gap property" when there is no tractable boundary between two disjoint sets of instances. We establish a Gap Trichotomy Theorem for a family of constraint problem variants, completely classifying the…

Computational Complexity · Computer Science 2017-03-28 Lucy Ham

The ternary Goldbach conjecture states that every odd number n>=7 is the sum of three primes. The estimation of sums of the form \sum_{p\leq x} e(\alpha p), \alpha = a/q + O(1/q^2), has been a central part of the main approach to the…

Number Theory · Mathematics 2013-12-31 H. A. Helfgott

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…

Number Theory · Mathematics 2014-10-21 William D. Banks , Tristan Freiberg , Caroline L. Turnage-Butterbaugh

We prove the integrality of the open instanton numbers in two examples of counting holomorphic disks on local Calabi-Yau threefolds: the resolved conifold and the degenerate $ \P \times \P $. Given the B-model superpotential, we extract by…

High Energy Physics - Theory · Physics 2015-06-26 Daniel Grunberg

We introduce a new technique that is used to show that the complex projective plane blown up at 6, 7, or 8 points has infinitely many distinct smooth structures. None of these smooth structures admit smoothly embedded spheres with…

Geometric Topology · Mathematics 2007-05-23 Ronald Fintushel , Ronald J. Stern

In 1922 Hardy and Littlewood proposed a conjecture on the asymptotic density of admissible prime k-tuples. In 2011 Wolf computed the "Skewes number" for twin primes, i.e., the first prime at which a reversal of the Hardy-Littlewood…

Number Theory · Mathematics 2019-10-08 László Tóth

We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a…

Number Theory · Mathematics 2014-05-22 Adrian Dudek

We prove that the set of normalized differences between primes, defined as $S = \{(p-q)/(p+q) : p > q \text{ are primes}\}$, is dense in the open unit interval $(0,1)$. Our proof provides an explicit construction algorithm with quantitative…

General Mathematics · Mathematics 2025-06-17 Paul Alexander Bilokon

Given any irrational number $\alpha$, we show that for any $0<\theta<6/17$, there are infinitely many $y$-smooth (friable) numbers $n$ such that $$\|n\alpha\| < n^{-\theta},$$ where $(\log n)^C\leq y\leq n$ for some large constant $C>0$.…

Number Theory · Mathematics 2026-03-31 Kunjakanan Nath , Habibur Rahaman

Let E be an elliptic curve over Q. In 1988, Koblitz conjectured a precise asymptotic for the number of primes p up to x such that the order of the group of points of E over the finite field F_p is prime. This is an analogue of the Hardy and…

Number Theory · Mathematics 2007-09-11 Antal Balog , Alina Cojocaru , Chantal David

Let $\epsilon > 0$ be sufficiently small and let $0 < \eta < 1/522$. We show that if $X$ is large enough in terms of $\epsilon$ then for any squarefree integer $q \leq X^{196/261-\epsilon}$ that is $X^{\eta}$-smooth one can obtain an…

Number Theory · Mathematics 2023-06-22 Alexander P. Mangerel

This paper was written, apart from one technical correction, in July and August of 2013. The, then very recent, breakthrough of Y. Zhang \cite{Z} had revived in us an intention to produce a second edition of our book "Opera de Cribro", one…

Number Theory · Mathematics 2014-01-14 J. B. Friedlander , H. Iwaniec

This paper studies integer solutions to the ABC equation A+B+C=0 in which none of A, B, C has a large prime factor. Set H(A,B, C)= max(|A|,|B|,|C|) and set the smoothness S(A, B, C) to be the largest prime factor of ABC. We consider…

Number Theory · Mathematics 2011-07-11 Jeffrey C. Lagarias , K. Soundararajan

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…

General Mathematics · Mathematics 2015-02-24 Maurice Margenstern , Yaroslav D. Sergeyev

In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume $E_2$-values; i.e., values that are products of…

Number Theory · Mathematics 2008-03-19 D. A. Goldston , S. W. Graham , J. Pintz , C. Y. Yildirim

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…

General Mathematics · Mathematics 2015-11-24 Dhananjay P. Mehendale

A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…

Number Theory · Mathematics 2014-03-25 Juan Arias de Reyna , Toulisse Jeremy

Twin prime number problem is mainly the structure of the twin prime numbers and whether there are infinitely many prime twins group. In this paper, by constructing a special cluster number set(see formula(2.3)in the paper), proves that the…

General Mathematics · Mathematics 2014-05-14 Zhang Baoshan

We discuss an obstruction to a knot being smoothly slice that comes from minimum-genus bounds on smoothly embedded surfaces in definite 4-manifolds. As an example, we provide an alternate proof of the fact that the (2,1)-cable of the figure…

Geometric Topology · Mathematics 2023-03-21 Paolo Aceto , Nickolas A. Castro , Maggie Miller , JungHwan Park , András Stipsicz

We prove an explicit analogue of Legendre's conjecture for almost primes. Namely, for every integer $n \geq 1$, the interval $(n^2,(n+1)^2)$ contains an integer having at most $3$ prime factors, counted with multiplicity. This improves the…

Number Theory · Mathematics 2026-05-20 Peter J. Campbell