Erdős Problem #359 — Growth of the Greedy Consecutive-Sum Sequence
Statement
For a sequence and , let mean that , that is strictly increasing, and that for every , is the least natural number such that and cannot be written as
for any with . If , prove both that
and that, for every real number ,
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.