Related papers: Gaps between Primes in Beatty Sequences
The following is proven using arguments that do not revolve around the Riemann Hypothesis or Sieve Theory. If $p_n$ is the $n^{\rm th}$ prime and $g_n=p_{n+1}-p_n$, then $g_n=O({p_n}^{2/3})$.
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…
We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…
We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…
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 was written, apart from one technical correction, in July and August of 2013. The, then very recent, breakthrough of Y. Zhang \cite{Z} had revived in us an intention to produce a second edition of our book "Opera de Cribro", one…
In this paper, we analyze properties of prime number sequences produced by the alternating sum of higher-order subsequences of the primes. We also introduce a new sieve which will generate these prime number sequences via the systematic…
We use short divisor sums to approximate prime tuples and moments for primes in short intervals. By connecting these results to classical moment problems we are able to prove that a positive proportion of consecutive primes are within a…
Let $p_{k}$ denote the $k$-th prime and $d(p_{k}) = p_{k} - p_{k - 1}$, the difference between consecutive primes. We denote by $N_{\epsilon}(x)$ the number of primes $\leq x$ which satisfy the inequality $d(p_{k}) \leq (\log p_{k})^{2 +…
The article focuses on the problems of prime gaps and zero spacings. Possible solutions of several related problems such as the greatest lower bound, the least upper bound of the zero spacings, and the least upper bound of the prime gaps…
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…
In this paper several examples of gaps (lacunes) between dimensions of maximal and submaximal symmetric models are considered, which include investigation of number of independent linear and quadratic integrals of metrics and counting the…
We verify the Hardy-Littlewood conjecture on primes in quadratic progressions on average. The results in the present paper significantly improve those of a previous paper of the authors(arXiv:math.NT/0605563).
A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…
We prove that the set of normalized differences between primes, defined as $S = \{(p-q)/(p+q) : p > q \text{ are primes}\}$, is dense in the open unit interval $(0,1)$. Our proof provides an explicit construction algorithm with quantitative…
In this article, a relation between a gap $d_{k}$ and divisors of composite numbers between $p_{k}$ and $p_{k+1}$ is established.
An excess of events with a rapidity gap between jets, over what would be expected from non-diffractive processes, has been observed at HERA. A process based on a perturbative QCD calculation of colour singlet exchange has been added to…
In previous papers the authors established the prime avoidance property of $k$-th powers of prime numbers and of prime numbers within Beatty sequences. In this paper the authors consider $k$-th powers of Piatetski-Shapiro primes.
Recently Oliver and Soundararajan made conjectures based on computational enumerations about the frequency of occurrence of pairs of last digits for consecutive primes. By studying Eratosthenes sieve, we have identified discrete dynamic…
For a polynomial $g(x)$ of deg $k \geq 2$ with integer coefficients and positive integer leading coefficient, we prove an upper bound for the least prime $p$ such that $g(p)$ is in non-homogeneous Beatty sequence $\lbrace \lfloor \alpha…