On the Shanks-Rényi race problem mod 5 (Q1343635)

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 714112
Language Label Description Also known as
default for all languages
No label defined
    English
    On the Shanks-Rényi race problem mod 5
    scientific article; zbMATH DE number 714112

      Statements

      On the Shanks-Rényi race problem mod 5 (English)
      0 references
      0 references
      25 October 1995
      0 references
      If as usual \(\pi (x,q, a)\) denotes the number of primes \(\leq x\) and \(\equiv a\pmod q\), then the race problem asks whether, for any permutation \(a_ 1, a_ 2, \dots, a_{\varphi(q)}\) of reduced residue classes \(\pmod q\), there are infinitely many values of \(m\) for which \[ \pi(m, q, a_ 1)> \pi(m, q, a_ 2)> \dots> \pi(m,q, a_{\varphi (q)}). \] The strong Race Hypothesis asserts that for each permutation, the set of \(m\) for which the above inequalities hold, has positive lower density. The problem can also be formulated replacing \(\pi (x,q, a)\) by \(\psi(x,q, a)\), the usual summatory function over \(\Lambda (n)\). With this replacement, the author proves the strong Race Hypothesis \(\pmod 5\) assuming the Generalized Riemann Hypothesis \(\pmod 5\).
      0 references
      primes in progressions
      0 references
      strong Race Hypothesis
      0 references
      Generalized Riemann Hypothesis
      0 references
      0 references

      Identifiers