相关论文: On the Density of Prime Imbalances in the Unit Int…

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}$.

Fix a modulus $q$. One would expect the number of primes in each invertible residue class mod $q$ to be multinomially distributed, i.e. for each $p \,\mathrm{mod}\, q$ to behave like an independent random variable uniform on…

We use Maynard's methods to show that there are bounded gaps between primes in the sequence $\{\lfloor n\alpha\rfloor\}$, where $\alpha$ is an irrational number of finite type. In addition, given a superlinear function $f$ satisfying some…

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

We study the first occurrences of gaps between primes in the arithmetic progression (P): $r$, $r+q$, $r+2q$, $r+3q,\ldots,$ where $q$ and $r$ are coprime integers, $q>r\ge1$. The growth trend and distribution of the first-occurrence gap…

We showed that the prime gap for a prime number p is less than or equal to the prime count of the prime number.

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 prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…

Although the prime numbers are deterministic, they can be viewed, by some measures, as pseudo-random numbers. In this article, we numerically study the pair statistics of the primes using statistical-mechanical methods, especially the…

In this paper we show that certain sets are dense in $\mathbb{R}$. We give some applications. For example, we show an analytical proof that $q^{\frac{1}{n}}$, $q$ is a prime number and $e$; are irrational numbers. As another application we…

On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.

The set of primes where a hypergeomeric series with rational parameters is $p$-adically bounded is known by [10] to have a Dirichlet density. We establish a formula for this Dirichlet density and conjecture that it is rare for the density…

Let $a_0=b_0=0$ and $0<a_1\leq b_1<a_2\leq b_2<\ldots\leq b_{n}$ be integers. Let $Q\left(x;\bigcup_{j=1}^{n}[a_j,b_j]\right)$ be the number of integers between $1$ and $x$ such that all exponents in their prime factorization are in…

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 prime numbers have been a source of fascination for millenia and continue to surprise us. Motivated by the hyperuniformity concept, which has attracted recent attention in physics and materials science, we show that the prime numbers in…

We prove that the average size of the squares of differences between consecutive primes less than $x$ is $O(x^{0.23+\varepsilon})$ for any fixed $\varepsilon>0$. This improves on a result of Peck, who gave bound $O(x^{0.25+\varepsilon})$ in…

We study the {pair correlations between} prime numbers in an interval $M \leq p \leq M + L$ with $M \rightarrow \infty$, $L/M \rightarrow \beta > 0$. By analyzing the \emph{structure factor}, we prove, conditionally on the {Hardy-Littlewood…

In this paper, we show a new upper bound of prime gaps, that is the gap between a prime number and its consecutive prime number. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…

We show that for any relatively prime integers $1\leq p<q$ and for any finite $A \subset \mathbb{Z}$ one has $$|p \cdot A + q \cdot A | \geq (p + q) |A| - (pq)^{(p+q-3)(p+q) + 1}.$$