Sign changes of \(\pi(x,q,1) - \pi(x,q,a)\) (Q1882137)
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 2108680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sign changes of \(\pi(x,q,1) - \pi(x,q,a)\) |
scientific article; zbMATH DE number 2108680 |
Statements
Sign changes of \(\pi(x,q,1) - \pi(x,q,a)\) (English)
0 references
19 October 2004
0 references
Assuming the Generalized Riemann Hypothesis the function \(\pi(x,q,1)-\pi(x,q,a)\) has infinitely many sign changes. Given a bijection \(\sigma\) of the set \(\{1,2,\dots,\varphi(q)\}\), it is unknown if there are arbitrary large values \(x\) such that the inequalities \[ \pi(x,q,\sigma(1))>\pi(x,q,\sigma(2))>\dots>\pi(x,q,\sigma(\varphi(q))) \] hold \((\varphi(q)>2)\). The author proves -- assuming the GRH -- a lower bound on the number of sign changes of \(\pi(t,q,1)-\max_{a\not\equiv\pmod q} \pi (x,q,a)\) in the range \(1\leq t\leq x\). It is explicit, but depends on \(f(q)\), the number of solutions of the congruence \(x^2\equiv 1\pmod q\). By the same arguments the author proves a lower bound on the number of sign changes of \(\pi(x)-\text{li}x\), assuming GRH, too.
0 references
comparative prime number theory
0 references
Shanks-Rényi-race problem
0 references
primes in progression
0 references
0.8212139010429382
0 references
0.8199739456176758
0 references
0.8183836936950684
0 references