Related papers: Almost arithmetic progressions in the primes and o…
Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…
In this note, we describe an infinite family of sharp Szemer\'{e}di-Trotter constructions. These constructions are cartesian products of arbitrarily high dimensional generalized arithmetic progressions (GAPs), where the bases for these GAPs…
In this paper we state and prove the statement that tame hereditary algebras have finitely many m-maximal green sequences using a generalized version of Br\"ustle-Dupont-P\'erotin's argument that tame quivers have finitely many maximal…
We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…
We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…
The twin primes conjecture is a very old problem. Tacitly it is supposed that the primes it deals with are finite. In the present paper we consider three problems that are not related to finite primes but deal with infinite integers. The…
Let p_n denote the sequence of all primes and let d_n=p_n-p_{n-1} denote the sequence of all gaps between consecutive primes. In 1948 Erd\H{o}s and Tur\'an showed that d_{n+1}-d_n changes sign infinitely often and together with P\'olya…
The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…
Introducing the notion of a rational system of measure preserving transformations and proving a recurrence result for such systems, we give sufficient conditions in order a subset of rational numbers to contain arbitrary long arithmetic…
A new explicit formula is proved for the contribution of the major arcs in the Goldbach and Generalized Twin Prime Problem, in which the level of the major arcs can be chosen very high. This will have many applications in the approximations…
In this paper, we study how close the terms of a finite arithmetic progression can get to a perfect square. The answer depends on the initial term, the common difference and the number of terms in the arithmetic progression.
For a given finitely generated multiplicative subgroup of the rationals which possibly contain negative numbers, we derive, subject to GRH, formulas for the densities of primes for which the index of the reduction group has a given value.…
We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…
A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…
Some basic properties of the ring of integers $\mathbb{Z}$ are extended to entire rings. In particular, arithmetic in entire principal rings is very similar than arithmetic in the ring of integers $\mathbb{Z}$. These arithmetic properties…
In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.
In 1973 Erdos asked whether there are n-vertex partial Steiner triple systems with arbitrary high girth and quadratically many triples. (Here girth is defined as the smallest integer g \ge 4 for which some g-element vertex-set contains at…
We partition a series of natural numbers into infinite number sequences. We consider two partitioning options: (a) a forest of unary trees with recurrence formula of Mersenne numbers, and (b) a set of arithmetic progressions with difference…
In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…
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,…