Related papers: The gaps in the multiplication table
Definition of the number of prime numbers in the given interval
We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…
We study the gaps between products of two primes in imaginary quadratic number fields using a combination of the methods of Goldston-Graham-Pintz-Yildirim \cite{GGPY}, and Maynard \cite{MAY}. An important consequence of our main theorem is…
We prove that deciding whether a given input word contains as subsequence every possible permutation of integers $\{1,2,\ldots,n\}$ is coNP-complete. The coNP-completeness holds even when given the guarantee that the input word contains as…
In this paper, we study the number of representations of a positive integer $n$ by two positive integers whose product is a multiple of a polygonal number.
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…
The three gap theorem (or Steinhaus conjecture) asserts that there are at most three distinct gap lengths in the fractional parts of the sequence $\alpha,2\alpha,\ldots,N\alpha$, for any integer $N$ and real number $\alpha$. This statement…
We give a proof of the Marker-Steinhorn Theorem which fills a gap in previous proofs of the result.
We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…
The theorem presented in this paper allows the creation of large prime numbers (of order up to o(n^2)) given a table of all primes up to n.
As a refinement of the celebrated recent work of Yitang Zhang we show that any admissible k-tuple of integers contains at least two primes and almost primes in each component infinitely often if k is at least 181000. This implies that there…
This paper reports the results of a search for first occurrences of square-free gaps using an algorithm based on the sieve of Eratosthenes. Using Qgap(L) to denote the starting number of the first gap having exactly the length L, the…
For a natural number $N\geq 2$ and a real $\alpha$ such that $0 < \alpha \leq \sqrt{N}-1$, we define $I_\alpha:=[\alpha,\alpha+1]$ and $I_\alpha^-:=[\alpha,\alpha+1)$ and investigate the continued fraction map $T_\alpha:I_\alpha \to…
We prove that a positive proportion of the gaps between consecutive primes are short gaps of length less than any fixed fraction of the average spacing between primes.
We bring to bear an empirical model of the distribution of twin primes and produce two distinct results. The first is that we can make a quantitative probabilistic prediction of the occurrence of gaps in the sequence of twins within the…
In this paper, we study the "sum composition problem" between two lists $A$ and $B$ of positive integers. We start by saying that $B$ is "sum composition" of $A$ when there exists an ordered $m$-partition $[A_1,\ldots,A_m]$ of $A$ where $m$…
Suppose that all groups of order $n$ are defined on the same set $G$ of cardinality $n$, and let the \emph{distance} of two groups of order $n$ be the number of pairs $(a,b)\in G\times G$ where the two group operations differ. Given a group…
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…
We define reflective numbers and their iterative summations. We provide classification of reflective numbers based on their iterative cyclical limits.
We study the properties of certain graphs involving the sums of primes. Their structure largely turns out to relate to the distribution of prime gaps and can be roughly seen in Cram\'er's model as well. We also discuss generalizations to…