## Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

### Chebyshev bounds for Beurling numbers

Acta Arithmetica

The first author conjectured that Chebyshev-type prime bounds hold for Beurling generalized numbers provided that the counting function N(x) of the generalized integers satisfies the L¹ condition ${\int }_{1}^{\infty }|N\left(x\right)-Ax|dx/{x}^{2}<\infty$ for some positive constant A. This conjecture was shown false by an example of Kahane. Here we establish the Chebyshev bounds using the L¹ hypothesis and a second integral condition.

### Optimality of Chebyshev bounds for Beurling generalized numbers

Acta Arithmetica

If the counting function N(x) of integers of a Beurling generalized number system satisfies both ${\int }_{1}^{\infty }{x}^{-2}|N\left(x\right)-Ax|dx<\infty$ and ${x}^{-1}\left(logx\right)\left(N\left(x\right)-Ax\right)=O\left(1\right)$, then the counting function π(x) of the primes of this system is known to satisfy the Chebyshev bound π(x) ≪ x/logx. Let f(x) increase to infinity arbitrarily slowly. We give a construction showing that ${\int }_{1}^{\infty }|N\left(x\right)-Ax|{x}^{-2}dx<\infty$ and ${x}^{-1}\left(logx\right)\left(N\left(x\right)-Ax\right)=O\left(f\left(x\right)\right)$ do not imply the Chebyshev bound.

Page 1