AbstractIn this paper, we study generalised prime systems for which both the prime and integer counting functions are asymptotically well-behaved, in the sense that they are approximately li(x) and ρx, respectively (where ρ is a positive constant), with error terms of order O(xθ1) and O(xθ2) for some θ1,θ2<1. We show that it is impossible to have both θ1 and θ2 less than 12
In classical prime number theory several asymptotic relations are considered to be "equivalent" to t...
In classical prime number theory there are several asymptotic formulas said to be “equivalent” to th...
Given β ∈ (0,1), we show the existence of a Beurling generalized number system whose integer countin...
We investigate the existence of well-behaved Beurling number systems, which are systems of Beurling ...
AbstractIn this paper, we study generalised prime systems for which both the prime and integer count...
AbstractIn this paper we study generalised prime systems for which the integer counting function NP(...
AbstractIn this paper we study generalized prime systems for which the integer counting function NP(...
We study generalized prime systems P and generalized integer systems N obtained from them. The asymp...
AbstractTextIn this paper, we prove a generalization of Mertens' theorem to Beurling primes, namely ...
In this thesis we extend two important theorems in analytic prime number theory to a the setting of ...
We find asymptotics for SK,c(x), the number of positive integers below x whose number of prime facto...
We study generalised prime (g-prime) systems $\calP$ and g-integer systems $\mathcal{N}$ obtained fr...
144 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.This paper is a study by &quo...
We show that for Beurling generalized numbers the prime number theorem in remainder form $$\pi(x) = ...
In this paper we prove a generalization of Mertens ’ theorem to Beurling primes, namely that limnÑ8 ...
In classical prime number theory several asymptotic relations are considered to be "equivalent" to t...
In classical prime number theory there are several asymptotic formulas said to be “equivalent” to th...
Given β ∈ (0,1), we show the existence of a Beurling generalized number system whose integer countin...
We investigate the existence of well-behaved Beurling number systems, which are systems of Beurling ...
AbstractIn this paper, we study generalised prime systems for which both the prime and integer count...
AbstractIn this paper we study generalised prime systems for which the integer counting function NP(...
AbstractIn this paper we study generalized prime systems for which the integer counting function NP(...
We study generalized prime systems P and generalized integer systems N obtained from them. The asymp...
AbstractTextIn this paper, we prove a generalization of Mertens' theorem to Beurling primes, namely ...
In this thesis we extend two important theorems in analytic prime number theory to a the setting of ...
We find asymptotics for SK,c(x), the number of positive integers below x whose number of prime facto...
We study generalised prime (g-prime) systems $\calP$ and g-integer systems $\mathcal{N}$ obtained fr...
144 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.This paper is a study by &quo...
We show that for Beurling generalized numbers the prime number theorem in remainder form $$\pi(x) = ...
In this paper we prove a generalization of Mertens ’ theorem to Beurling primes, namely that limnÑ8 ...
In classical prime number theory several asymptotic relations are considered to be "equivalent" to t...
In classical prime number theory there are several asymptotic formulas said to be “equivalent” to th...
Given β ∈ (0,1), we show the existence of a Beurling generalized number system whose integer countin...
DOI
Add to ORKG