Related papers: Prime Tuples and Siegel Zeros

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…

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

ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a…

In the present work we investigate the largest possible gaps between consecutive numbers which can be written as the difference of two primes. The best known upper bounds are the same as those concerning the largest possible difference of…

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be Chebyshev's prime-counting function for primes congruent to $a$ modulo $q$. We show that under the assumption of an…

1. There is no existing any quadratic interval $\eta_{n}:=(n^{2},(n+1)^{2}],$ which contains less than 2 prime numbers. The number of prime numbers within $\eta_{n}$ goes averagely linear with n to infinity. 2. The exact law of the number…

On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.

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…

We prove that there is a prime between $n^3$ and $(n+1)^3$ for all $n \geq \exp(\exp(33.217))$. Our new tool which we derive is a version of Landau's explicit formula for the Riemann zeta-function with explicit bounds on the error term. We…

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…

We discuss recent advances on weak forms of the Prime $k$-tuple Conjecture, and its role in proving new estimates for the existence of small gaps between primes and the existence of large gaps between primes.

For any positive integer $k$, we show that infinitely often, perfect $k$-th powers appear inside very long gaps between consecutive prime numbers, that is, gaps of size $$ c_k \frac{\log p \log_2 p \log_4 p}{(\log_3 p)^2}, $$ where $p$ is…

For any $m \geq 1$, let $H_m$ denote the quantity $H_m := \liminf_{n \to \infty} (p_{n+m}-p_n)$, where $p_n$ denotes the $n^{\operatorname{th}}$ prime; thus for instance the twin prime conjecture is equivalent to the assertion that $H_1$ is…

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

The Selberg sieve provides majorants for certain arithmetic sequences, such as the primes and the twin primes. We prove an L^2-L^p restriction theorem for majorants of this type. An immediate application is to the estimation of exponential…

This paper proposes, and demonstrates the efficacy of, an elementary method for establishing a lower bound for cardinalities of selected sets of twin primes, and shows that the proof employed may be modified for selected sets of Goldbach…

We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic…

In the recent preprint [3], Goldston, Pintz, and Y{\i}ld{\i}r{\i}m established, among other things, $$ \liminf_{n\to\infty}{p_{n+1}-p_n\over\log p_n}=0,\leqno(0) $$ with $p_n$ the $n$th prime. In the present article, which is essentially…

In 1737 Leonard Euler gave what we often now think of as a new proof, based on infinite series, of Euclid's theorem that there are infinitely many prime numbers. Our short paper uses a simple modification of Euler's argument to obtain new…

Some new results concerning the equation $\sigma(N)=aM, \sigma(M)=bN$ are proved. As a corollary, there are only finitely many odd superperfect numbers with a fixed number of distinct prime factors.