AbstractLet A be an infinite sequence of positive integers a1 < a2 <… and put fA(x) = Σa∈A, a≤x(1a), DA(x) = max1≤n≤xΣa∈A,an1. In Part I, it was proved that limx→+∞supDA(x)fA(x) = +∞. In this paper, this theorem is sharpened by estimating DA(x) in terms of fA(x). It is shown that limx→+∞sup DA(x) exp(−c1(logfA(x))2) = +∞ and that this assertion is not true if c1 is replaced by a large constant c2
AbstractLet a1 < a2 < … be a sequence of positive integers such that no ak is a sum of distinct othe...
AbstractLet Ψ(x, y) denote the number of positive integers ≦ x and free of prime factors > y. De Bru...
AbstractLet ϵ(N) > 0 be a function of positive integers N and such that ϵ(N) → 0 and Nϵ(N) → ∞ as N ...
AbstractThe number defined by the title is denoted by Ψ(x, y). Let u = log xlog y and let ϱ(u) be th...
AbstractWe prove the following conjecture of Erdös. If f(n) is an additive function and 1xΣn≤x|f(n +...
AbstractFor logylog log x → ∞ as x → ∞, ψ(Cx, y) ≈ Cψ(x, y) uniformly for C in compact subsets of (0...
AbstractAn elementary construction of a sequence of positive integers is given. The sequence settles...
AbstractThis paper is a continuation of previous work by Győri, Sárközy, and the author, concerning ...
AbstractFor a > 0 let ψa(x, y) = ΣaΩ(n), the sum taken over all n, 1 ≤ n ≤ x such that if p is prime...
AbstractIn this paper we prove (in a rather more precise form) two conjectures of P. Erdös about the...
AbstractLet f(n) denote the number of factorizations of the natural number n into factors larger tha...
AbstractWe prove that, if f(z) is an entire function and ¦f(z)¦ ⩽ (A1 + A2 ¦z¦n) exp[ax2 + by2 + cx ...
AbstractA well-known theorem of Erdös and Fuchs states that we cannot have too good an asymptotic fo...
AbstractWe give an upper bound for some exponential sums over primes, using only sieve methods and C...
AbstractSuppose the integer-counting function N of a system of generalized prime numbers satisfies N...
AbstractLet a1 < a2 < … be a sequence of positive integers such that no ak is a sum of distinct othe...
AbstractLet Ψ(x, y) denote the number of positive integers ≦ x and free of prime factors > y. De Bru...
AbstractLet ϵ(N) > 0 be a function of positive integers N and such that ϵ(N) → 0 and Nϵ(N) → ∞ as N ...
AbstractThe number defined by the title is denoted by Ψ(x, y). Let u = log xlog y and let ϱ(u) be th...
AbstractWe prove the following conjecture of Erdös. If f(n) is an additive function and 1xΣn≤x|f(n +...
AbstractFor logylog log x → ∞ as x → ∞, ψ(Cx, y) ≈ Cψ(x, y) uniformly for C in compact subsets of (0...
AbstractAn elementary construction of a sequence of positive integers is given. The sequence settles...
AbstractThis paper is a continuation of previous work by Győri, Sárközy, and the author, concerning ...
AbstractFor a > 0 let ψa(x, y) = ΣaΩ(n), the sum taken over all n, 1 ≤ n ≤ x such that if p is prime...
AbstractIn this paper we prove (in a rather more precise form) two conjectures of P. Erdös about the...
AbstractLet f(n) denote the number of factorizations of the natural number n into factors larger tha...
AbstractWe prove that, if f(z) is an entire function and ¦f(z)¦ ⩽ (A1 + A2 ¦z¦n) exp[ax2 + by2 + cx ...
AbstractA well-known theorem of Erdös and Fuchs states that we cannot have too good an asymptotic fo...
AbstractWe give an upper bound for some exponential sums over primes, using only sieve methods and C...
AbstractSuppose the integer-counting function N of a system of generalized prime numbers satisfies N...
AbstractLet a1 < a2 < … be a sequence of positive integers such that no ak is a sum of distinct othe...
AbstractLet Ψ(x, y) denote the number of positive integers ≦ x and free of prime factors > y. De Bru...
AbstractLet ϵ(N) > 0 be a function of positive integers N and such that ϵ(N) → 0 and Nϵ(N) → ∞ as N ...