Odd greedy expansion explained

In number theory, the odd greedy expansion problem asks whether a greedy algorithm for finding Egyptian fractions with odd denominators always succeeds. It is an open problem.

Description

An Egyptian fraction represents a given rational number as a sum of distinct unit fractions. If a rational number

x/y is a sum of unit fractions with odd denominators,(x)/(y) = \sum (1)/(2 a _{i+1}) , then y must be odd. Conversely, every fraction x/y with y odd can be represented as a sum of distinct odd unit fractions. One method of finding such a representation replaces x/y by Ax/Ay where A =35 ⋅ 3 ^{i} for a sufficiently large i , and then expands Ax as a sum of distinct divisors of Ay .^[1]

However, a simpler greedy algorithm has successfully found Egyptian fractions in which all denominators are odd for all instances

x/y (with odd y ) on which it has been tested: let u be the least odd number that is greater than or equal to y/x , include the fraction 1 /u in the expansion, and continue in the same way (avoiding repeated uses of the same unit fraction) with the remaining fraction x/y -1 /u . This method is called the odd greedy algorithm and the expansions it creates are called odd greedy expansions.

Stein, Selfridge, Graham, and others have posed the open problem of whether the odd greedy algorithm terminates with a finite expansion for every

x/y with y odd.

Example

Let

x/y = 4/23.

23/4 = 5; the next larger odd number is 7. So the first step expands

161/5 = 32; the next larger odd number is 33. So the next step expands

5313/4 = 1328; the next larger odd number is 1329. So the third step expands

Since the final term in this expansion is a unit fraction, the process terminates with this expansion as its result.

Fractions with long expansions

It is possible for the odd greedy algorithm to produce expansions that are shorter than the usual greedy expansion, with smaller denominators. For instance,$$\backslash frac=\backslash frac+\backslash frac+\backslash frac=\backslash frac+\backslash frac,$$where the left expansion is the greedy expansion and the right expansion is the odd greedy expansion. However, the odd greedy expansion is more typically long, with large denominators. For instance, as Wagon discovered, the odd greedy expansion for 3/179 has 19 terms, the largest of which is approximately 1.415×10⁴³⁹⁴⁹¹. Curiously, the numerators of the fractions to be expanded in each step of the algorithm form a sequence of consecutive integers:A similar phenomenon occurs with other numbers, such as 5/5809 (an example found independently by K. S. Brown and David Bailey) which has a 27-term expansion. Although the denominators of this expansion are difficult to compute due to their enormous size, the numerator sequence may be found relatively efficiently using modular arithmetic. describes several additional examples of this type found by Broadhurst, and notes that K. S. Brown has described methods for finding fractions with arbitrarily long expansions.

On even denominators

The odd greedy algorithm cannot terminate when given a fraction with an even denominator, because these fractions do not have finite representations with odd denominators. Therefore, in this case, it produces an infinite series expansion of its input. For instance Sylvester's sequence can be viewed as generated by the odd greedy expansion of 1/2.

External links

• MathPages - Odd-Greedy Unit Fraction Expansions, K. S. Brown

Notes and References

1. .