Beurling integers with RH and large oscillation (Q2189509): Difference between revisions

Let \(N(x)\) and \(\pi(x)\) count the number of generalized integers and primes, respectively, not exceeding a given number \(x\). In the paper under review the authors prove that there exists a Beurling generalized number system such that \[ \pi(x) =Li(x)+O(\sqrt{x}), \] where \(Li\) stands for the logarithmic integral. Also, they show for any constant \(c>2\sqrt{2}\) that \[ N(x)=\rho x+\Omega_{\pm}(x\exp(-c\sqrt{\log x \log\log x}), \] where \(\rho>0\) is the asymptotic density of \(N\). The method for showing this result is first to construct a continuous analogue of a number system having the desired properties and then to find a suitable discrete approximation to it, yielding the sought discrete Beurling number system. The authors also prove that there exists an absolutely continuous prime distribution function \(\Pi_C\) with associated integer distribution function \(N_C\) such that \[ \Pi_C(x)=\int_1^x\frac{1-u^{-1}}{\log u}\,du+O(1), \] and, for any constant \(c>2\sqrt{2}\), \[ N_C(x)=\rho x+\Omega_{\pm}(x\exp(-c\sqrt{\log x \log\log x}), \] where \(\rho>0\) is the asymptotic density of \(N_C\).