Abstract:
We obtain a lower bound for $\#\{x/2<p_n\leq x:\, p_n\equiv \dots \equiv p_{n+m}\equiv a\pmod {q}$, $p_{n+m} - p_n\leq y\}$, where $p_n$ is the $n$th prime.
Keywords:
Euler's totient function, sieve methods, distribution of prime numbers.
This work was performed at the Steklov International Mathematical Center and supported by the Ministry of Science and Higher Education of the Russian Federation (agreement no. 075-15-2019-1614).
Citation:
Artyom O. Radomskii, “Consecutive Primes in Short Intervals”, Analytic and Combinatorial Number Theory, Collected papers. In commemoration of the 130th birth anniversary of Academician Ivan Matveevich Vinogradov, Trudy Mat. Inst. Steklova, 314, Steklov Math. Inst., Moscow, 2021, 152–210; Proc. Steklov Inst. Math., 314 (2021), 144–202