Erdős Problem #287 — Gaps in Egyptian Fraction Representations of One
Statement
For every integer and every strictly increasing sequence of natural numbers satisfying , the maximum consecutive gap is at least .
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.