Erdős Problem #358 — Consecutive subsums with unbounded representation counts
Let be a strictly increasing infinite sequence of integers. For each integer , let be the number of pairs of positive integers with for which the sum over the consecutive block from through equals :
Does there exist such a sequence for which as ? The question also asks whether one can have for every sufficiently large ; this is a weaker target than divergence of . Erdős Problems #358
Background
The problem is recorded in Erdős’s 1977 discussion of combinatorial number theory and in the 1980 collection by Erdős and Graham. A simple benchmark is : for positive , the number of consecutive-block representations is the number of odd divisors of . The 1980 collection also asks whether every sufficiently large integer can be represented at least once. That condition alone is immediate for , since singleton blocks represent every positive integer; requiring at least two representations avoids this triviality. Erdős Problems #358 Erdős (1977), Problems and results on combinatorial number theory. III Erdős and Graham (1980), Old and new problems and results in combinatorial number theory
A related question studied by Moser and Erdős takes to be the primes. They conjectured that the limsup of the number of representations is infinite, but could not prove even that the integers admitting such a representation have positive upper density. In modern additive-combinatorial language, the consecutive-block count can be viewed as a self-correlation of the indicator of a convex set of integers. Erdős Problems #358 Moser (1963), Notes on number theory. III. On the sum of consecutive primes
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
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.