The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
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 $∫_1^∞ |N(x) - Ax| dx/x^2 < ∞$ 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...
If the counting function N(x) of integers of a Beurling generalized number system satisfies both $∫_1^∞ x^{-2}|N(x)-Ax| dx < ∞ $ and $x^{-1}(log x)(N(x)-Ax) = O(1)$, 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 $∫_1^∞ |N(x)-Ax|x^{-2} dx <...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.