A set of generalized numbers showing Beurling's theorem to be sharp (Q2536841): Difference between revisions

\textit{A. Beurling} [Acta Math. 68, 255--291 (1937; Zbl 0017.29604)] proved that the prime number theorem is valid for generalized numbers (cf. the definition of the preceding review [Ill. J. Math. 14, 12--28 (1970; Zbl 0186.36403)]) provided \(N(x)=cx + O(x \log^{-\gamma}x)\) for some \(c>0\) and \(\gamma>3/2\). He showed this result is sharp by exhibiting a continuous ``prime measure'' and an associated ``integer measure'' for which \(\gamma=3/2\) but for which the prime number theorem is false. In the present paper a set of g-primes \(\{p_i\}_{i=1}^{\infty}\) is explicitly constructed for which \(N(x)=cx + O(x \log^{-3/2}x)\) and the PNT is false. The method is based on Beurling's example and the exponential representation technique which was developed in the preceding article [loc. cit.].