Erdős Problem #1147 — Quadratic recurrence sets as additive bases
For an integer n ≥ 2, let , and for an irrational real number define
Is an additive basis of order 2; that is, does there exist an integer such that every integer has a representation with ? Repeated summands are allowed. Erdős Problem #1147 Konieczny (2016)
Background
The question is listed as [Va99, 1.21] and concerns the additive structure of a quadratic recurrence set: its elements are those indices at which the sequence comes unusually close to an integer. The logarithmic threshold tends to zero, so membership imposes an increasingly stringent approximation condition. The issue is not simply whether the set is large, but whether its elements represent every sufficiently large integer as a sum of two. Erdős Problem #1147 Konieczny (2016)
Konieczny’s work places this problem in the broader study of sets defined by shrinking recurrence conditions and their additive-basis properties. The contrast with independent random sets is instructive: the paper notes that a random set with fixed inclusion probability typically has its two-fold sumset covering all sufficiently large integers once the integers are on the scale of roughly . The quadratic recurrence condition, however, imposes arithmetic structure that can produce exceptional integers missed by every pairwise sum. Konieczny (2016)
References
J. Konieczny, Sets of recurrence as bases for the positive integers, Acta Arithmetica 174 (2016), no. 4, 309–338.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.