Related papers: Patterns of primes
Several examples of generalized number systems are constructed to compare various conditions occurring in the literature for the prime number theorem in the context of Beurling generalized primes.
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
The main result of the paper is that assuming that the level $\theta$ of distribution of primes exceeds 1/2, then there exists a positive $d\leq C(\theta)$ such that there are arbitrarily long arithmetic progressions with the property that…
Prime numbers appeared in contexts spanning statistical mechanics, quantum mechanics and dynamical systems. However, the mechanisms governing the irregularities observed in their sequence and linking them to physical systems remained…
We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.
We prove that there are infinitely often pairs of primes much closer than the average spacing between primes - almost within the square root of the average spacing. We actually prove a more general result concerning the set of values taken…
I give some claims on primorial prime numbers for interested readers in number theory.
This paper analyzes the emergence and distribution of potential twin primes, pairs of integers that are both relatively prime to the first n primes or to a given set M of primes, and which are the breeding grounds of true twin primes. It…
We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.
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…
This paper is devoted to the theory of prime numbers. In this paper we first introduce the notion of a matrix of prime numbers. Then, in order to investigate the density of prime numbers in separate rows of the matrix under consideration,…
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…
Tao conjectured that every dense subset of $\mathcal{P}^d$, the $d$-tuples of primes, contains constellations of any given shape. This was very recently proved by Cook, Magyar, and Titichetrakun and independently by Tao and Ziegler. Here we…
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
I present a new property of prime numbers that leads to a generalization of Cramer's conjecture. The study of the gap between consecutive primes is treated as a special case of the gap between consecutive terms of sequences having a certain…
We survey the classical results on the prime number theorem
In this note, we generalize an ancient Greek inequality about the sequence of primes to the cases of arithmetic progressions even multivariable polynomials with integral coefficients. We also refine Bouniakowsky's conjecture [16] and…
We found a regularity of the behavior of primes that allows to represent both prime and natural numbers as infinite matrices with a common formation rule of their rows. This regularity determines a new class of infinite cyclic groups that…
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…
A geometric-arithmetic progression of primes is a set of $k$ primes (denoted by GAP-$k$) of the form $p_1 r^j + j d$ for fixed $p_1$, $r$ and $d$ and consecutive $j$, {\it i.e}, $\{p_1, \, p_1 r + d, \, p_1 r^2 + 2 d, \, p_1 r^3 + 3 d,…