The greedy algorithm for Egyptian fractions takes as input a fraction x/y, and repeatedly expands x/y = 1/d + x'/y', where d=ceiling(y/x) is the smallest possible denominator such that 1/d is at most x/y. Once one reaches a remaining fraction x/y such that (in its simplest form) x = 1, the algorithm terminates.

Analogously, define a subgreedy expansion of x/y to be the result of repeatedly expanding either x/y = 1/d + x'/y' as above, or x/y = 1/(d+1) + x'/y', where d=ceiling(y/x) as before. Also as before, the expansion terminates as soon as the remaining fraction has a unit numerator in its simplest form.

To keep the definitions simple we allow repeated unit fractions such as 2/3 = 1/3 + 1/3, unlike traditional Egyptian fractions which require all denominators to differ from each other. We also count 1/2 + 1/3 + ... as different from 1/3 + 1/2 + ... However, these details make little difference for the questions we pose here.

For instance, the greedy expansion of 3/7 is 1/3 + 1/11 + 1/231. However, after the first greedy step 3/7 = 1/3 + 2/21, a different subgreedy expansion is possible, by choosing the next fraction to be 1/12 instead of 1/11: 3/7 = 1/3 + 1/12 + 1/84. The other two possible subgreedy expansions are 1/4 + 1/6 + 1/84 and 1/4 + 1/7 + 1/28. The expansion 3/7 = 1/3 + 1/15 + 1/35 is not subgreedy, because the second denominator 15 is too much higher than the greedy choice 11, and the expansion 3/7 = 1/4 + 1/7 + 1/29 + 1/812 is not subgreedy because we must stop as soon as the remaining fraction 1/28 has a unit denominator rather than continuing to expand it as 1/28 = 1/29 + 1/812.

Conjecture. Any fraction x/y has a finite number of subgreedy expansions. More precisely for x/y < 1 the number of expansions is O(y).

The significance of this conjecture is that the odd greedy expansion is a subgreedy expansion. It's a well-studied open problem whether the odd greedy algorithm always terminates, but its termination would follow directly from this conjecture, because if the odd greedy algorithm didn't terminate one could find infinitely many subgreedy expansions by running odd greedy for some number of steps then switching to greedy. However, the conjecture abstracts away the complications of oddness, leaving a perhaps simpler problem. In addition it allows the focus to be on the number of solutions rather than the length of an individual solution, which seems a more promising line of attack.

As evidence for the conjecture, I verified computationally that there are finitely many expansions for all fractions with 0 < x < y ≤ 2500. For y ≤ 1000, the largest ratio of the number of expansions to y that I found was for 27/29, which has 59 expansions for a ratio of 2.0345. However fractions with significantly larger denominators still can have many expansions; for instance 207/211 has 276 expansions, 318/347 has 384 expansions, 327/373 has 423 expansions, 418/457 has 469 expansions, and 855/983 has 998 expansions.

As with the odd greedy algorithm, it is not easy to calculate the denominators of all subgreedy expansions because they grow doubly exponentially with the lengths of the expansions, rapidly becoming too large for computer memory. However, the numerators of the remaining fractions x/y after each step of the expansion can be calculated more easily using modular arithmetic. Essentially, everything need be done only modulo the product of the numerators seen so far. For instance, there is a 29-term subgreedy expansion of 247/313 for which the remaining numerators after each step (in simplest form) are 247, 181, 279, 497, 561, 268, 471, 89, 171, 277, 379, 563, 929, 317, 279, 367, 709, 549, 191, 243, 379, 271, 353, 659, 1033, 53, 41, 71, 1. This pattern seems much more random than the numerator sequences seen in known long odd greedy expansions.

The length of the longest expansion seems to grow more slowly than the square root of y, but I haven't run enough analysis to conclude anything more definite about that.