scientific article; zbMATH DE number 1059203
For coprime positive integers \(a,q\), let \(E(x,q,a)=\psi(x,q,a)-x/\phi(q)\), the remainder term in the prime number theorem for primes \(p\equiv a\pmod q\). Write \(E_\delta(x,q,a)=E(x,q,a)-E(\delta x,q,a)\), where \(0\leq\delta<1\), let \(v(T,q,a,\delta)\) denote the number of changes of sign for \(E_\delta(x,q,a)\) in the interval \(T\leq x\leq eT\), and set \[ \bar v(q,\delta)=\min_{(a,q)=1}\limsup_{T\to\infty}v(T,q,a,\delta). \] From considerations in the interval \(2\leq x\leq T\) one may deduce that \(\bar v(1,\delta)\geq5\). In this interesting paper the author uses his method in the study of the Shanks-Rényi race problem [\textit{J. Kaczorowski}, Q. J. Math., Oxf. II. Ser. 44, No. 176, 451-458 (1993; Zbl 0799.11030), J. Number Theory 50, No. 1, 106-118 (1995; Zbl 0822.11063), J. Reine Angew. Math. 446, 89-113 (1994; Zbl 0783.11033)] to give much better estimates for \(\bar v(q,\delta)\), especially when \(\delta\) is near 1. The result depends on the positions of the non-trivial zeros of \(L\)-functions and some technical notation is required to state the theorem. Let \(A(q)\geq2\phi(q)\) denote the least constant with the property that for every \(x>A(q)\) the interval \((x,ex)\) always contains \(x/(\phi(q)\log x)\geq3\) primes \(p\equiv a\pmod q\) for every \(a\) coprime with \(q\). Let \[ {\mathcal L}(\rho,q,a)={1\over\phi(q)}\sum_{\chi\pmod q}\overline{\chi(a)} m(\rho,\chi), \] where \(m(\rho,\chi)\) denotes the multiplicity of the zero \(s=\rho\) of \(L(s,\chi)\), with \(m(\rho,\chi)=0\) if \(L(\rho,\chi)\neq 0\). It is known that \({\mathcal L}(\rho,q,a)\neq 0\) for infinitely many non-trivial zeros \(\rho\). Finally set \[ \Gamma_0(q)=\sup\{T:{\mathcal L}(\rho,q,a)=0 \text{\;for\;all\;}\rho=\beta+i\gamma \text{\;with\;}\beta>1/2 \text{\;and\;}|\gamma|<T\}. \] The theorem states that if \(L(\sigma,\chi)\neq 0\) for \(0<\sigma<1\) and all \(\chi\) (mod \(q\)) then \[ \bar v(q,\delta)\geq\min\Big({\Gamma_0(q)\over\pi},\Big(2\phi(q)(1-\delta)\log{1\over 4 (1-\delta)}\Big)^{-1}-4\Big)\qquad \text{ for}\quad 1-{1\over 8A(q)}\leq\delta<1. \] As a corollary, if the Generalised Riemann Hypothesis is true (so that \(\Gamma_0(q)=\infty\)) and that \(L({1\over 2},\chi)\neq 0\) for all \(\chi\) (mod \(q\)) then \(\bar v(q,\delta)\to\infty\) as \(\delta\to1^-\). From computation for \(A(1)\) and \(\Gamma_0(1)\) the author deduces that \[ \bar v(1,\delta)\geq\begin{cases} 1.73\cdot 10^8 &\text{for}\quad 1-1.4\cdot 10^{-10}\leq\delta<1,\\ 100 &\text{for}\qquad 0.99917<\delta<1 ,\\ 13 &\text{for}\qquad 0.99082<\delta<1.\end{cases}. \] For the entire collection see [Zbl 0868.00042].
- On sign-changes in the remainder-term of the prime-number formula, I
- On sign-changes in the remainder-term of the prime-number formula, IV
- On sign-changes in the remainder-term of the prime-number formula, II
- On sign-changes in the remainder-term of the prime-number formula, III
- On a method of estimating from below the number of sign changes of arithmetic functions.
- Oscillatory properties of arithmetical functions. I
- On a method of estimating from below the number of sign changes of arithmetic functions.
- Sign changes of \(\pi(x,q,1) - \pi(x,q,a)\)
- Large deviations of the limiting distribution in the Shanks-Rényi prime number race
- Prime number races for elliptic curves over function fields
- On the number of sign changes in the remainder-term of the prime-ideal theorem
- On sign-changes in the remainder-term of the prime-number formula, IV
- Boundary values of Dirichlet series and the distribution of primes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353516)