On the arcsine law on divisors in arithmetic progressions (Q297982): Difference between revisions

Let \(d(n)\) denote the number of divisors of \(n\), and put \[ F_n(t)= {1\over d(n)}\;\sum^1_{i|n,i\leq n^t}\quad (0\leq t\leq 1). \] By using methods by \textit{Z. Cui} and \textit{J. Wu} [Acta Arith. 163, No. 3, 247--260 (2014; Zbl 1303.11108)], the following generalization of the arcsine law by \textit{J.-M. Deshouillers} et al. [Acta Arith. 34, 273--285 (1979; Zbl 0408.10035)] is proved: Let \((a,q)= 1\) and suppose that \(q\) is not a Sigel ``exceptional'' modulus. Then there is an absolute constant \(0<\varepsilon< 1/4\) such that \[ {1\over x/q}= \sum_{n\leq x, n\equiv a \pmod q} F_n(t)= (2/\pi),\;\arcsin\sqrt{t}+ O_\varepsilon \Biggl({e^{\sqrt{\log q}\over \sqrt{\log x}}}\Biggr) \] holds uniformly for \(0\leq t\leq 1\), \(x\geq 2\) and \(q\leq\exp\{({1\over 4}-\varepsilon)(\log_2 x)^2\}\). Here a modulus \(q\) is called ``exceptional'' if there is a primitive quadratic character \(\chi\pmod q\) such that \(L(s,\chi)\) has a real zero \(\beta\) such that \(\beta>1- c/\log q\).