相关论文: On Maximal Prime Gaps

We study the gaps between consecutive prime numbers directly through Eratosthenes sieve. Using elementary methods, we identify a recursive relation for these gaps and for specific sequences of consecutive gaps, known as constellations.…

Let $p$ and $q$ be two distinct fixed prime numbers and $(n_i)_{i\geq 0}$ the sequence of consecutive integers of the form $p^a\cdot q^b$ with $a,b\ge 0$. Tijdeman gave a lower bound (1973) and an upper bound (1974) for the gap size…

We investigate logarithmic and square-root types of bounds for the general difference of two primes, $P_{k+q}-P_k$, $k, q\in\mathbb{N}$.

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

The degree of insulation of a prime $p$ is defined as the largest interval around it in which no other prime exists. Based on this, the $n$-th prime $p_{n}$ is said to be insulated if and only if its degree of insulation is higher than its…

In the recent preprint [3], Goldston, Pintz, and Y{\i}ld{\i}r{\i}m established, among other things, $$ \liminf_{n\to\infty}{p_{n+1}-p_n\over\log p_n}=0,\leqno(0) $$ with $p_n$ the $n$th prime. In the present article, which is essentially…

Baker, Harman, and Pintz showed that a weak form of the Prime Number Theorem holds in intervals of the form $[x-x^{0.525},x]$ for large $x$. In this paper, we extend a result of Maynard and Tao concerning small gaps between primes to…

One field of particular interest in Number Theory concerns the gaps between consecutive primes. Within the last few years, very important results have been achieved on how small these gaps can be. The strongest of these results were…

We formulate, using heuristic reasoning, precise conjectures for the range of the number of primes in intervals of length $y$ around $x$, where $y\ll (\log x)^2$. In particular we conjecture that the maximum grows surprisingly slowly as $y$…

Let $q>r\ge1$ be coprime integers. Let $R(n,q,r)$ be the $n$th record gap between primes in the arithmetic progression $r$, $r+q$, $r+2q,\ldots,$ and denote by $N_{q,r}(x)$ the number of such records observed below $x$. For $x\to\infty$, we…

Let $q>r\ge1$ be coprime integers. Let ${\mathbb P}_c={\mathbb P}_c(q,r,{\cal H})$ be an increasing sequence of primes $p$ satisfying two conditions: (i) $p\equiv r$ (mod $q$) and (ii) $p$ starts a prime $k$-tuple with a given pattern…

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…

We study whether several consecutive prime gaps can all be relatively large at the same time, or is it possible that all are squares or perfect powers, or perhaps none of them are squares? A few related results and problems are also…

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

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, using the well known fact that the series of reciprocals of primes diverges, we obtain a general inequality for gaps of consecutive primes that holds for infinitely many primes. As it is shown the key ingredient for this…

In a recent joint work with D.A. Goldston and C.Y. Yildirim we just missed by a hairbreadth a proof that bounded gaps between primes occur infinitely often. In the present work it is shown that adding to the primes a much thinner set,…

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

For $(M,a)=1$, put \begin{equation*} G(X;M,a)=\sup_{p^\prime_n\leq X}(p^\prime_{n+1}-p^\prime_n), \end{equation*} where $p^\prime_n$ denotes the $n$-th prime that is congruent to $a\pmod{M}$. We show that for any positive $C$, provided $X$…

We generalise Zhang's and Pintz recent results on bounded prime gaps to give a lower bound for the the number of prime pairs bounded by 6*10^7 in the short interval $[x,x+x (\log x)^{-A}]$. Our result follows only by analysing Zhang's proof…