Strings of Congruent Primes (Q4520388)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1542928
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strings of Congruent Primes |
scientific article; zbMATH DE number 1542928 |
Statements
Strings of Congruent Primes (English)
0 references
13 December 2000
0 references
primes in arithmetic progressions
0 references
consecutive primes
0 references
0.7788788
0 references
0.7594952
0 references
0.7317425
0 references
0 references
0.7189726
0 references
0 references
0.71362066
0 references
0.7127475
0 references
Let \(p_n\) denote the \(n\)-th prime. S.~Chowla conjectured that for all coprime \(a\) and \(q\) there are infinitely many pairs of consecutive primes with \(p_n\equiv p_{n+1} \equiv a \bmod q\) [see chapter A4 of \textit{R. K. Guy}, Unsolved problems in number theory. 2nd ed. (1994; Zbl 0805.11001)]. In the present paper the author proves this conjecture. Indeed he shows that there are strings of congruent primes such that \[ p_n\equiv p_{n+1} \cdots \equiv p_{n+k} \equiv a \bmod q \] and \(k \gg (\frac{\log \log x \log \log \log \log x}{(\log \log \log x)^2})^{1/\varphi(q)}\). For certain combinations of \(a\) and \(q\) a slightly larger value of \(k\) is admissible. For the frequency \(B(x)\) of such strings with \(p_{n+k} \leq x\) it is proved that there exists a constant \(C_q\) such that \(B(x) \gg x^{1- \varepsilon(x)}\), where \(\varepsilon(x)= C_q k ( \frac{(\log \log \log x)^2}{\log \log x \log \log \log \log x})^{1/\varphi(q)}\). (In the comment after theorem 2 there is a factor of \(\log x\) missing in the brackets.) In the final section the author mentions that this can be adapted to prove that there are \(( \frac{\log \log x}{\log \log \log x})^{1/2}\) consecutive primes which are quadratic residues (or nonresidues) modulo \(q\). The proof is an adaption of Maier's method [\textit{H. Maier}, Adv. Math. 39, 257-269 (1981; Zbl 0457.10023)].
0 references