English
Related papers

Related papers: Bounded gaps between primes of the special form

200 papers

This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…

General Mathematics · Mathematics 2017-11-01 Kevin B. Espinet

It is proven that there are infinitely prime pairs whose difference is no greater than 84. In proving that result, a new sieve weight is constructed. The new idea is to construct the largest sieve support which admits the use of the…

Number Theory · Mathematics 2022-08-02 Chunlei Liu

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

Number Theory · Mathematics 2013-03-01 Terence Tao , Tamar Ziegler

It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…

Number Theory · Mathematics 2024-07-24 Aleksandr Tuxanidy , Daniel Panario

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 introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

Number Theory · Mathematics 2007-05-23 D. A. Goldston , J. Pintz , C. Y. Yildirim

Zhang has shown there are infinitely many intervals of bounded length containing two primes. It appears that the current techniques cannot prove that there are infinitely many intervals of bounded length containing three primes, even if…

Number Theory · Mathematics 2013-06-06 James Maynard

Using Duke's large sieve inequality for Hecke Gr{\"o}ssencharaktere and the new sieve methods of Maynard and Tao, we prove a general result on gaps between primes in the context of multidimensional Hecke equidistribution. As an application,…

Number Theory · Mathematics 2020-04-13 Jesse Thorner

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 show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently known unconditionally. In particular, we derive…

Number Theory · Mathematics 2022-07-05 Kevin Ford

The number of primes of a kind x^2+1 is infinite.

General Mathematics · Mathematics 2008-02-12 V. Govorov

Let $1 < c < 24/19$. We show that the number of integers $n \le N$ that cannot be written as $[p_1^c] + [p_2^c]$ ($p_1$, $p_2$ primes) is $O(N^{1-\sigma+\varepsilon})$. Here $\sigma$ is a positive function of $c$ (given explicitly) and…

Number Theory · Mathematics 2021-11-19 Roger Baker

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…

Number Theory · Mathematics 2019-05-01 Gérald Tenenbaum

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

Number Theory · Mathematics 2017-01-11 Zhi-Wei Sun

We prove that there are infinitely many integers $n$ such that $n$ and $n+1$ have the same number of distinct prime divisors.

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

We take the pre-sieved set to be all natural numbers $N=\{1,2,3,\dots\}$ with a sieve system:single sieve,double sieve,.... With single sieve, i.e. , remove out the multiple of a prime, we derive all the primes. With double sieve, i.e. ,…

General Mathematics · Mathematics 2019-11-26 Guangchang Dong

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

Number Theory · Mathematics 2025-08-12 Soumya Bhattacharya , Habibur Rahaman

We showed that the prime gap for a prime number p is less than or equal to the prime count of the prime number.

General Mathematics · Mathematics 2020-07-31 Ya-Ping Lu , Shu-Fang Deng

By a sphere-packing argument, we show that there are infinitely many pairs of primes that are close to each other for some metrics on the integers. In particular, for any numeration basis $q$, we show that there are infinitely many pairs of…

Number Theory · Mathematics 2017-11-17 Minjia Shi , Florian Luca , Patrick Solé

For a pair of distinct non-CM newforms of weights at least 2, having rational integral Fourier coefficients $a_{1}(n)$ and $a_{2}(n)$, under GRH, we obtain an estimate for the set of primes $p$ such that $$ \omega(a_1(p)-a_2(p)) \le […

Number Theory · Mathematics 2023-12-20 Arvind Kumar , Moni Kumari