Related papers: Consecutive primes in short intervals

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

We show that \[\sum_{\substack{p_n\le x\\ p_{n+1}-p_n\ge\sqrt{p_n}}}(p_{n+1}-p_n)\ll_{\varepsilon} x^{3/5+\varepsilon}\] for any fixed $\varepsilon>0$. This improves a result of Matom\"{a}ki, in which the exponent was $2/3$.

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

For $m,q \in \mathbb{N}$, we call an $m$-tuple $(a_1,\ldots,a_m) \in \prod_{i=1}^m (\mathbb{Z}/q\mathbb{Z})^\times$ good if there are infinitely many consecutive primes $p_1,\ldots,p_m$ satisfying $p_i \equiv a_i \pmod{q}$ for all $i$. We…

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

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

We solve a problem due to Recam\'an about the lower bound behavior of the maximum possible length among all arithmetic progressions in the least reduced residue system modulo $n$, as $n \to \infty$.

We show that $$\sum_{\substack{p_n \in [x, 2x] \\ p_{n+1} - p_n \ge x^{1/2}}} (p_{n+1} - p_n) \ll x^{0.57+\epsilon}$$ and $$\sum_{\substack{p_n \in [x, 2x] \\ p_{n+1} - p_n \ge x^{0.45}}} (p_{n+1} - p_n) \ll x^{0.63+\epsilon},$$ where $p_n$…

Let $p>5$ be a fixed prime. We obtain an asymptotic formula related to small solutions of quadratic congruences of the form $x_1^2+x_2^2\equiv x_3^2\bmod{p^n}$ where $\max\{|x_1|,|x_2|,|x_3|\}\le p^{\nu n}$ with $\nu>1/2$.

In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers $a$ and $b$, with…

For n=1,2,3,... define S(n) as the smallest integer m>1 such that those 2k(k-1) mod m for k=1,...,n are pairwise distinct; we show that S(n) is the least prime greater than 2n-2 and hence the value set of the function S(n) is exactly the…

We develop a sieve that can detect primes in multiplicatively structured sets under certain conditions. We apply it to obtain a new $L$-function free proof of Linnik's problem of bounding the least prime $p$ such that $p\equiv a\pmod q$…

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

Let $\alpha, \beta \geq 0$ and $\alpha + \beta < 1$. In this short note, we show that $\liminf_{n \to \infty} p_n^\beta(p_{n+1}^\alpha - p_n^\alpha) = 0$, where $p_n$ is the $n$th prime. This notes an improvement over results of S\'{a}ndor…

We prove an upper bound for the least prime in an irrational Beatty sequence. This result may be compared with Linnik's theorem on the least prime in an arithmetic progression.

We obtain a lower bound for a number of primes in tuples. As applications, we obtain a lower bound for the Romanoff type representation functions.

The author sharpens a result of Jia (1996), showing that the interval $[n, n+n^{\frac{1}{21.5}+\varepsilon}]$ contains prime numbers for almost all $n$. Watt's mean value bound, a delicate sieve decomposition and more accurate estimates for…

We find an upper bound for the sum $\sum_{x<n\leq 2x}\textbf{1}_{\mathbb{P}}(n+h_{i_{1}})\cdots\textbf{1}_{\mathbb{P}}(n+h_{i_{m+1}})w_{n}$, where $(h_{i_{1}},...,h_{i_{m+1}})$ is any $(m+1)$-tuple of elements in the admissible set…