English
Related papers

Related papers: Bounded gaps between primes with a given primitive…

200 papers

Fix an integer $g \neq -1$ that is not a perfect square. In 1927, Artin conjectured that there are infinitely many primes for which $g$ is a primitive root. Forty years later, Hooley showed that Artin's conjecture follows from the…

Number Theory · Mathematics 2016-01-20 Paul Pollack

A famous conjecture of Artin states that there are infinitely many prime numbers for which a fixed integer $g$ is a primitive root, provided $g \neq -1$ and $g$ is not a perfect square. Thanks to work of Hooley, we know that this conjecture…

Number Theory · Mathematics 2015-04-16 Lee Troupe

Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…

Number Theory · Mathematics 2025-08-11 Ayla Gafni , Terence Tao

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…

Number Theory · Mathematics 2014-07-08 Lynn Chua , Soohyun Park , Geoffrey D. Smith

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,…

Number Theory · Mathematics 2010-04-08 Janos Pintz

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

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

Number Theory · Mathematics 2018-02-08 Yu-Chen Sun , 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

Let $E$ be an elliptic curve over $\Q$ without complex multiplication, and which is not isogenous to a curve with non-trivial rational torsion. For each prime $p$ of good reduction, let $|E(\F_p)|$ be the order of the group of points of the…

Number Theory · Mathematics 2008-12-16 Chantal David , Jie Wu

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

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the…

Number Theory · Mathematics 2022-07-19 Alina Carmen Cojocaru , McKinley Meyer

Let $p_n$ denote the $n$th prime and $g_n:=p_{n+1}-p_n$ the $n$th prime gap. We demonstrate the existence of infinitely many values of $n$ for which $g_n>g_{n+1}>\cdots>g_{n+m}$ with $m\gg \log\log\log n$ and similarly for the reversed…

Number Theory · Mathematics 2016-04-12 D. K. L. Shiu

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

Number Theory · Mathematics 2019-02-06 Nathan McNew

We propose the formula for the number of pairs of consecutive primes $p_n, p_{n+1}<x$ separated by gap $d=p_{n+1}-p_n$ expressed directly by the number of all primes $<x$, i.e. by $\pi(x)$. As the application of this formula we formulate 7…

Number Theory · Mathematics 2018-04-24 Marek Wolf

We show that under the assumption of Artin's Primitive Root Conjecture, for all primes p there exist ordinary elliptic curves over $\bar F_p(x)$ with arbitrary high rank and constant j-invariant. For odd primes p, this result follows from a…

Number Theory · Mathematics 2007-05-23 Irene I. Bouw , Claus Diem , Jasper Scholten

Let $p\geq 2$ be a large prime, and let $N\gg ( \log p)^{1+\varepsilon}$. This note proves the existence of primitive roots in the short interval $[M,M+N]$, where $M \geq 2$ is a fixed number, and $ \varepsilon>0$ is a small number. In…

General Mathematics · Mathematics 2020-05-27 N. A. Carella

Let $(X,B_X,\mu,T)$ be a measure-preserving probability system with $T$ is invertible. Suppose that $A\in B_X$ with $\mu(A)>0$ and $\epsilon>0$. For any $m\geq 1$, there exist infinitely many primes $p_0,p_1,\ldots,p_m$ with…

Number Theory · Mathematics 2016-08-22 Hao Pan

Let us call a simple graph on $n\geq 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n$, and in fact for every $n\geq 2$ if we assume the Riemann…

Fix a non-CM elliptic curve $E/\mathbb{Q}$, and let $a_E(p) = p + 1 - \#E(\mathbb{F}_p)$ denote the trace of Frobenius at $p$. The Sato-Tate conjecture gives the limiting distribution $\mu_{ST}$ of $a_E(p)/(2\sqrt{p})$ within $[-1, 1]$. We…

Number Theory · Mathematics 2020-01-08 Nate Gillman , Michael Kural , Alexandru Pascadi , Junyao Peng , Ashwin Sah

Given an elliptic curve $E$ over $\mathbb{Q}$ and non-zero integer $r$, the Lang--Trotter conjecture predicts a striking asymptotic formula for the number of good primes $p\leqslant x$, denoted by $\pi_{E,r}(x)$, such that the Frobenius…

Number Theory · Mathematics 2025-11-25 Daqing Wan , Ping Xi
‹ Prev 1 2 3 10 Next ›