English
Related papers

Related papers: Primes in LCM recurrences

200 papers

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 show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

Number Theory · Mathematics 2023-01-09 Ernie Croot , Hamed Mousavi , Maxie Schmidt

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$. Our main result shows that the primes are equidistributed for a fixed residue class over all moduli of size $x^{1/2+\delta}$ with a…

Number Theory · Mathematics 2021-04-07 James Maynard

The thesis gave a fine study on the distribution of the coefficients of automorphic L-functions for GL(m) with m>1. In particular we have treated two types of problems: change of signs of these coefficients (when they are real) and their…

Number Theory · Mathematics 2009-02-07 Yan Qu

We establish a result of Bombieri-Vinogradov type for the Dirichlet coefficients at prime ideals of the standard $L$-function associated to a self-dual cuspidal automorphic representation $\pi$ of $\mathrm{GL}_n$ over a number field $F$…

Number Theory · Mathematics 2023-05-03 Yujiao Jiang , Guangshi Lü , Jesse Thorner , Zihao Wang

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

Number Theory · Mathematics 2007-09-23 Ben Green , Terence Tao

In this paper we prove two results concerning Vinogradov's three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_1,…

Number Theory · Mathematics 2019-02-20 Kaisa Matomäki , Xuancheng Shao

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

Number Theory · Mathematics 2017-07-24 Acquaah Peter

In this paper, we use the former of the authors developed theory of \emph{circles of partition} to investigate possibilities to prove the binary Goldbach and Lemoine conjectures. We state the \emph{squeeze principle} and its consequences…

Number Theory · Mathematics 2026-04-21 Theophilus Agama , Berndt Gensel

In this paper, we study an asymptotic distribution of sets of primes satisfying certain "linking conditions" in arithmetic topology, namely, conditions given by the Legendre and R\'edei symbols among sets of primes. As our Main Theorem, we…

Number Theory · Mathematics 2024-05-24 Yuki Ishida , Atsuki Kuramoto , Dingchuan Zheng

The Cram\'er-Granville conjecture is an upper bound on prime gaps, $g_n = p_{n+1} - p_n < \cCramer \, \log^2 p_n$ for some constant $\cCramer \geq 1$. Using a formula of Selberg, we first prove the weaker summed version: $\sum_{n=1}^N g_n <…

Number Theory · Mathematics 2015-10-08 André LeClair

Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$,…

General Mathematics · Mathematics 2009-09-14 Shaohua Zhang

We introduce a modification of the linear sieve whose weights satisfy strong factorization properties, and consequently equidistribute primes up to size $x$ in arithmetic progressions to moduli up to $x^{10/17}$. This surpasses the level of…

Number Theory · Mathematics 2024-02-15 Jared Duker Lichtman

Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…

Number Theory · Mathematics 2025-08-18 Robert Dougherty-Bliss , Mits Kobayashi , Natalya Ter-Saakov , Eugene Zima

The quantitative distribution of twin primes remains a central open problem in number theory. This paper develops a heuristic model grounded in the principles of sieve theory, with the goal of constructing an analytical approximation for…

General Mathematics · Mathematics 2025-07-14 Yuhang Shi

Recently we have introduced a novel characterisation of the distribution of twin primes that consists of three essential elements. These are: that the twins are most naturally viewed as a subsequence of the primes themselves, that the…

Number Theory · Mathematics 2007-05-23 P. F. Kelly , Terry Pilling

We make progress on a conjecture of Cilleruelo on the growth of the least common multiple of consecutive values of an irreducible polynomial $f$ on the additional hypothesis that the polynomial be even. This strengthens earlier work of…

Number Theory · Mathematics 2024-01-12 Marc Technau

A conjecture of Erd\H{o}s states that, for any large prime $q$, every reduced residue class $\pmod q$ can be represented as a product $p_1p_2$ of two primes $p_1,p_2\leq q$. We establish a ternary version of this conjecture, showing that,…

Number Theory · Mathematics 2024-02-16 Kaisa Matomäki , Joni Teräväinen

Probabilistic models for the distribution of primes in the natural numbers are constructed in the article. The author found and proved the probabilistic estimates of the deviation $R(x)=|\pi(x)- Li(x)|$. The author has analyzed the…

General Mathematics · Mathematics 2015-03-03 Victor Volfson

Consider a system \Psi of non-constant affine-linear forms \psi_1,...,\psi_t: Z^d -> Z, no two of which are linearly dependent. Let N be a large integer, and let K be a convex subset of [-N,N]^d. A famous and difficult open conjecture of…

Number Theory · Mathematics 2008-04-22 Ben Green , Terence Tao
‹ Prev 1 3 4 5 6 7 10 Next ›