Professional Documents
Culture Documents
1970 23erdos
1970 23erdos
1 . Let 1 < al < . . . < ak =< x be a sequence of integers for which the sums
k
(1) u Eiai, c-i = - 0 or 1
i=1
are all distinct . Put nlax k =.f(x) where the maximum is taken over all sequences
satisfying (1) . It is easy to see that
log x log log x
f(x) < 2 ± 0(1),
log 2 + lo bw
and Moser and I proved
log x log log x
(2) f(x) < 0(1) .
log 2 + 2 10 ~
b 2 +
'This is the best-known upper bound for f(x) .
Is it true that
(3) f(x) = (log x/log 2) + 0(1)?
1\Mloser and I asked : Is it true that f (2 11) >_ k+2 for sufficiently large k? Conway
and Guy showed that the answer is affirmative (unpublished) .
P . Erdös, Problems and results in additive number theory, Colloque, Théorie
des Nombres, Bruxelles 1955, p . 137 .
2 . Let 1 < a 1 < . . . < ak <_ x be a sequence of integers so that all the sums
ai,+ . . .+ais, i 1 <i 2 < . . . =< is, 1 < s <r
can hold only if c = 0 and the sequence, a, < • • • , is finite . Fuchs and I proved
a very much stronger result than (8) . We in fact showed that if c > 0 then
x x lia
(9) 1:h(n) =cx+o
n=1 (log x) 12 )
is impossible . Jurkat showed (unpublished) that (9) is impossible even with
o(x 111) . Perhaps Jurkat's result is best possible and
x
E h(n)
n-1
= cx + 0(x1/,)
CLASSROOM NOTES
EDITED BY DAVID DRASIN
Manuscripts for this Department should be sent to David Drasin, Division of Mathematical
Sciences, Purdue University, Lafayette, IN 47907 .