Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
The question as the note states it (printed p. 6199): "Let be integers such that no is the sum of (any 2 or more) consecutive -s. Is it possible for to be significantly larger than ?" The note first records Pomerance's example , , the set , and the family for with odd, , "a set having elements, which is one more than the trivial set ".
The construction (pp. 6199--6201). "The following construction shows that may be attained." For positive integers take
- (A) the consecutive integers ;
- (B) the integers in not divisible by ;
- (C) the even integers in ;
- (D) all the integers from to ,
numbers in all, and delete from (D) the elements equal to a sum of consecutive elements: the sums of three consecutive elements of (A) (I), of two consecutive elements of (B) (II), of four consecutive elements of (A) (III), of two consecutive elements of (C) (IV), and of two or three consecutive elements straddling a junction (A)--(B), (B)--(C) or (C)--(D) (V). The conditions (i) and , (ii) , (iii) and (iv) make the blocks increasing and keep the other consecutive sums out of the set (p. 6200). The note then states (p. 6201) that classes I and II coincide and III and IV coincide, so that elements are deleted; that the conditions (i)--(iv), in effect (iii), require ; and that with the remaining set has members up to , the proportion .
The infinite version (pp. 6201--6202). With the number of members at most of an infinite sequence: "We can achieve using the previous construction" (p. 6201). The construction is repeated with very rapidly growing : with the sum of all members so far, take , form the next finite segment, and delete the in four ranges of length about (, , , ). The note asserts that no remaining member is then a sum of consecutive others, and that the loss of about members is negligible against , so the proportion is kept (p. 6202).
Source. R. Freud, Adding numbers, James Cook Mathematical Notes 6 (1993), issue 60 (January 1993), 6199--6202; the scan of the whole issue read for this page has two printed pages per PDF page (printed pp. 6198--6199 on PDF p. 10, 6200--6201 on PDF p. 11, 6202--6203 on PDF p. 12), read on the page images at 150 dpi.
Read depth. Claims checked: the question, Pomerance's examples, the four blocks with their counts, the conditions (i)--(iv), the deletion list and its count, the closing sentence with , and , and the infinite version were read clause by clause on the page images. Two arithmetic checks were made here from the printed figures: at , and . The verification that no remaining member is a sum of consecutive members is the note's (the conditions (i)--(iv) and the coincidences I = II, III = IV are asserted with brief reasons) and is not checked here; an external Lean file behind the catalog's label proves it for its encoding of the same blocks (Problem 867's page), and nothing is independently reviewed here.
Proof pointer
pp. 6200--6201 as summarized above: the block sizes and spacings are chosen so that the only consecutive sums landing in the set are the listed sums of two, three or four consecutive members of (A), (B) or (C) and at their borders, all of which fall in (D) and are deleted; the coincidences I = II and III = IV keep the deletion count at .
Dependencies
None.
Bears on
- Problem 867: for the set has members, so is unbounded along these , against the problem's bound ; the verification that the set has no member a sum of consecutive members is the note's (the site: "Freud [Fr93] constructed a sequence with density ").
- Problem 839: the infinite version gives a sequence with no member a sum of two or more consecutive members and ; that problem asks whether every such sequence has , and whether its logarithmic density is , and this sequence decides neither.