English
Related papers

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

200 papers

We confirm, for the primes up to 3000, the conjecture of Bourgain, Gamburd, and Sarnak on strong approximation for the Markoff surface $x^2+y^2+z^2 = 3xyz$ modulo primes. For primes congruent to 3 modulo 4, we find data suggesting that some…

Number Theory · Mathematics 2018-12-19 Matthew de Courcy-Ireland , Seungjae Lee

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

General Mathematics · Mathematics 2023-07-31 Mbakiso Fix Mothebe

We study the gaps between consecutive prime numbers directly through Eratosthenes sieve. Using elementary methods, we identify a recursive relation for these gaps and for specific sequences of consecutive gaps, known as constellations.…

Number Theory · Mathematics 2007-06-07 Fred B. Holt

In this paper, the estimation formula of the number of primes in a given interval is obtained by using the prime distribution property. For any prime pairs $p>5$ and $ q>5 $, construct a disjoint infinite set sequence $A_1, A_2, \ldots,…

General Mathematics · Mathematics 2021-11-09 Yong Zhao , Jianqin Zhou

In this paper, we show some results about the gap between a prime number and its consecutive prime number for large enough prime numbers. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…

General Mathematics · Mathematics 2025-11-05 Cheng-Ting Wang

James Maynard has taken the analytic number theory world by storm in the last decade, proving several important and surprising theorems, resolving questions that had seemed far out of reach. He is perhaps best known for his work on small…

Number Theory · Mathematics 2023-08-10 Andrew Granville

We prove that there are infinitely many $n$ such that $\omega(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao-Ter\"{a}v\"{a}inen (2025), who has $O(k)$ in place of $O(\log k)$. As corollaries, we make progress…

Number Theory · Mathematics 2026-04-17 Cheuk Fung Lau

For each odd integer $p > 1$, we construct infinitely many pairwise non-diffeomorphic irreducible smooth structures on a definite 4-manifold with infinite fundamental group whose abelianization is $\Z/2p\Z\times \Z/2\Z$.

Geometric Topology · Mathematics 2026-04-24 Sebastián M. Camponovo , Rafael Torres

Motivated by a recent result of Y. Lee and the second author[7], we construct a simply connected minimal complex surface of general type with p_g=0 and K^2=3 using a rational blow-down surgery and Q-Gorenstein smoothing theory. In a similar…

Algebraic Geometry · Mathematics 2014-11-11 Heesang Park , Jongil Park , Dongsoo Shin

The famous conjecture of V.Ya.Ivrii says that {\it in every billiard with infinitely-smooth boundary in a Euclidean space the set of periodic orbits has measure zero}. In the present paper we study its complex analytic version for…

Dynamical Systems · Mathematics 2015-12-18 Alexey Glutsyuk

Let $m\geq 3$. Suppose that $$ 1-2^{-2^{m^24^m}}<\gamma<1. $$ Then the set $$ \{p\text{ prime}:\, p=[n^{\frac1\gamma}]\text{ for some }n\in{\mathbb N}\} $$ contains infinitely many non-trivial $m$-term arithmetic progressions.

Number Theory · Mathematics 2019-01-29 Hongze Li , Hao Pan

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

Number Theory · Mathematics 2015-09-08 Janos Pintz

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof for the…

General Mathematics · Mathematics 2017-10-24 N. A. Carella

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)$…

Number Theory · Mathematics 2015-07-28 Felix Sidokhine

Erd\H{o}s considered the second moment of the gap-counting function of prime divisors in 1946 and proved an upper bound that is not of the right order of magnitude. We prove asymptotics for all moments. Furthermore, we prove a…

Number Theory · Mathematics 2022-10-28 E. Sofos

The following is proven using arguments that do not revolve around the Riemann Hypothesis or Sieve Theory. If $p_n$ is the $n^{\rm th}$ prime and $g_n=p_{n+1}-p_n$, then $g_n=O({p_n}^{2/3})$.

Number Theory · Mathematics 2020-06-09 Madieyna Diouf

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…

Number Theory · Mathematics 2026-03-24 Andrew Lott , Nagendar Reddy Ponagandla

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

Number Theory · Mathematics 2014-08-13 Kolbjørn Tunstrøm

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…

Number Theory · Mathematics 2014-12-23 D. H. J. Polymath

We prove sharp smoothing properties of the averaging operator defined by convolution with a measure on a smooth nondegenerate curve $\gamma$ in $\mathbb R^d$, $d\ge 3$. Despite the simple geometric structure of such curves, the sharp…

Classical Analysis and ODEs · Mathematics 2022-04-01 Hyerim Ko , Sanghyuk Lee , Sewook Oh
‹ Prev 1 4 5 6 7 8 10 Next ›