No abstract

No abstract

Let {a 1 , a 2 , a 3 , . . .} be an unbounded sequence of positive integers with a n+1 /a n approaching α as n → ∞, and let β > max(α, 2). We show that for all sufficiently large xa set of nonnegative integers containing 0 and satisfying |A| 1 − 1 β x, then we can represent some element of the sequence {a n } as a pairwise sum of elements of A. We also prove an analogous result which holds for all x 0. In [1], Erdős and Freud conjectured if A ⊂ {1, 2, . . . , 3n} is a set of at least n + 1 elements then there is some power of two that could be written as the sum of distinct elements of A. This was proved by Erdős and Freiman [2] for sufficiently large n, and later improved by Nathanson and Sárközy [4]. We could also ask what happens if we restrict the number of summands. Lev [3] showed that if A ⊂ {0, 1, 2, . . . ,n} contains 0 and has at least n/2 + 1 elements, then a power of 2 can be written as the sum of two elements of A. And more recently, Pan [5] proved the essentially sharp result (for m 3): if 0 ∈ A, then |A| (1 − 1/m)n + 1 implies that a power of m can be written as the sum of two elements in A.In this paper, we consider sequences that grow essentially like the powers of a real number greater than or equal to 2. Given a set A, denote by 2A the set of pairwise sums {a 1 + a 2 : a 1 , a 2 ∈ A}. (Note that this set is usually denoted by A + A.) We then have the following result:

No abstract

Abstract. We show that on a short interval, x < n ≤ x + w, the average value of a complex-valued multiplicative function f (n) that is sufficiently close to 1 on primes and bounded on prime powers, tends to