Related papers: Medium-sized values for the Prime Number Theorem f…
We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…
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…
An overview of the results of new exhaustive computations of gaps between primes in arithmetic progressions is presented. We also give new numerical results for exceptionally large least primes in arithmetic progressions.
We study the distribution of prime numbers under the unlikely assumption that Siegel zeros exist. In particular we prove for \[ \sum_{n \leq X} \Lambda(n) \Lambda(\pm n+h) \] an asymptotic formula which holds uniformly for $h = O(X)$. Such…
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…
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…
In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.
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…
We generalize the classical Bombieri-Vinogradov theorem to a short interval, non-abelian setting. This leads to variants of the prime number theorem for short intervals where the primes lie in arithmetic progressions that are "twisted" by a…
We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.
If a set S of pairwise coprime moduli q, less than x^(9/40), is considered, one obtains the expected behavior for primes up to x in arithmetic progressions mod q, except for a subset of S whose cardinality is bounded by a power of log x.
We show that the exponent of distribution of the sequence of squarefree numbers in arithmetic progressions of prime modulus is $\geq 2/3 + 1/57$, improving a result of Prachar from 1958. Our main tool is an upper bound for certain bilinear…
We obtain an analog of the Montgomery-Hooley asymptotic formula for the variance of the number of primes in arithmetic progressions. In the present paper the moduli are restricted to the sequences of integer parts $[F(n)]$, where $F(t) =…
This note discusses the existence of prime numbers in short intervals. An unconditional elementary argument seems to prove the existence of primes in the short intervals [x, x + y], where y >= x^(1/2)(log x)^e, e > 0, and a sufficiently…
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,…
We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…
We prove explicit versions of Cram\'er's theorem for primes in arithmetic progressions, on the assumption of the generalized Riemann hypothesis.
Assume the Riemann hypothesis throughout. We obtain some new estimates for the size of the set of large values of the error term in the prime number theorem. Our argument is based on an analysis of the behavior of zeros of the Riemann zeta…
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…
In this paper, we study the distribution of the digital reverses of prime numbers, which we call the "reversed primes". We prove the infinitude of reversed primes in any arithmetic progression satisfying straightforward necessary conditions…