相关论文: On Maximal Prime Gaps

The prime number graph is the set of points $(n,p_n)$ where $p_n$ denotes the $n^{\rm th}$ prime. Let $L(n)$ be the minimum number of straight line segments needed to cover the first $n$ points in this set. Let $B(n)$ be the largest number…

Definition of the number of prime numbers in the given interval

The paper considers the asymptotic of the ratio of the number of primes not exceeding the primorial and the number of residues in the reduced system of residues for the given primorial. We study the relationship between asymptotic lower…

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

The most common difference that occurs among the consecutive primes less than or equal to $x$ is called a jumping champion. Occasionally there are ties. Therefore there can be more than one jumping champion for a given $x$. In 1999 A.…

Let $p_n$ denote the $n^{th}$ prime. Goldston, Pintz, and Yildirim recently proved that $ \liminf_{n\to \infty} \frac{(p_{n+1}-p_n)}{\log p_n} =0.$ We give an alternative proof of this result. We also prove some corresponding results for…

We obtain explicit forms of the current best known asymptotic upper bounds for gaps between squarefree integers. In particular we show, for any $x \ge 2$, that every interval of the form $(x, x + 11x^{1/5}\log x]$ contains a squarefree…

This article determines a lower bound for the number Germain primes $p$ and $2p+1$ up to a large number $x$.

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…

The Cram\'er-Granville conjecture is an upper bound on prime gaps, $g_n = p_{n+1} - p_n < \cCramer \, \log^2 p_n$ for some constant $\cCramer \geq 1$. Using a formula of Selberg, we first prove the weaker summed version: $\sum_{n=1}^N g_n <…

Let us call a simple graph on $n\geq 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n$, and in fact for every $n\geq 2$ if we assume the Riemann…

Let $p_{n}$ denote the $n$th prime and for any fixed positive integer $k$ and $X\geq 2$, put \[ G_{k}(X):=\max _{p _{n+k}\leq X} \min \{ p_{n+1}-p_{n}, \ldots , p_{n+k}-p_{n+k-1} \}. \] Ford, Maynard and Tao proved that there exists an…

Let $p_n$ denote the $n$-th prime number, $\{q_n\}$ be a sequence of positive numbers and $x\in\mathbb{R}$. In this note we prove that the inequality $$q_n p_{n+1}^{x}-q_{n+1}p_{n}^{x}<p_{n}^{x}p_{n+1}^{x-1}, $$ holds for infinitely many…

Let $p\geq 3$ be a prime and $n\geq 1$ be an integer. Let $K\subseteq {\mathbb{F}_p}$ denote a fixed subset with $0\in K$. Let $A\subseteq ({\mathbb{F}_p})^n$ be an arbitrary subset such that $$\{…

Let $p_n$ denote the $n$-th prime, and for any $k \geq 1$ and sufficiently large $X$, define the quantity $$ G_k(X) := \max_{p_{n+k} \leq X} \min( p_{n+1}-p_n, \dots, p_{n+k}-p_{n+k-1} ),$$ which measures the occurrence of chains of $k$…

For each prime $p$, let $I_p \subset \mathbb{Z}/p\mathbb{Z}$ denote a collection of residue classes modulo $p$ such that the cardinalities $|I_p|$ are bounded and about $1$ on average. We show that for sufficiently large $x$, the sifted set…

Combining the Hardy-Littlewood k-tuple conjecture with a heuristic application of extreme-value statistics, we propose a family of estimator formulas for predicting maximal gaps between prime k-tuples. Computations show that the estimator…

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, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…

Suppose that $1<c<9/8$. For any $m\geq 1$, there exist infinitely many $n$ such that $$ \{[n^c],\ [(n+1)^c],\ \ldots,\ [(n+k_0)^c]\} $$ contains at least $m+1$ primes, if $k_0$ is sufficiently large (only depending on $m$).