Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Definitions (printed p. 24): for a sequence of positive integers, is the set of all finite sums with , and is complete "if all sufficiently large integers belong to ". A sequence may repeat a value, and repeated values count separately in . Square brackets denote the integer part.
Question 12 (printed p. 36, quoted). "Let and be positive reals with irrational. Let denote the sequence . Is complete? What if is replaced by some , ?"
This is the statement of Problem 354 up to notation: the site's multiset is the paper's sequence , and the site's second question is the paper's last sentence. The paper offers no result on either question. Its nearest context is Question 2 (printed p. 34): for which with , is the sequence complete, known for from the author's 1964 Acta Arithmetica paper and, quoted, "Even in the range , it is not known what happens. Conceivably, is complete for all and ."
Source. R. L. Graham, On sums of integers taken from a fixed sequence, Proceedings of the Washington State University Conference on Number Theory (1971), 22--40; Question 12 on printed p. 36 = PDF p. 15, the definitions on printed p. 24 = PDF p. 3 and Question 2 on printed p. 34 = PDF p. 13 of the author's publication-page scan, read on the page images (the scan has no text layer). The artifact is identified in the source digest.
Read depth. Claims checked: the question, the definitions and Question 2 were read clause by clause on the page images. A question; the paper proves nothing about it. Nothing here is independently reviewed.
Proof pointer
None. The paper asks the question and stops.
Dependencies
None.
Bears on
- Problem 354: the problem's origin, in the wording the site's statement follows, including the second question with replaced by .