Erdős Problem #282 — Let A⊆ N be an infinite set and consider the following greedy algorithm for a rational x∈ (0,1): choose the minimal n∈ A such that n≥ 1/x and repeat with x replaced b…
Statement
Let be an infinite set and consider the following greedy algorithm for a rational : choose the minimal such that and repeat with replaced by . If this terminates after finitely many steps then this produces a representation of as the sum of distinct unit fractions with denominators from . Does this process always terminate if has odd denominator and is the set of odd numbers? More generally, for which pairs and does this process terminate?
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.