# conjecture on fractions with odd denominators

Suppose we wish to write fractions as sums of distinct unit fractions with odd denominators. Obviously, every such sum will have a reduced representation with an odd denominator.

For instance, the greedy algorithm applied to $\frac{2}{7}$ gives $\frac{1}{4}+\frac{1}{28}$, but we may also write $\frac{2}{7}$ as $\frac{1}{7}+\frac{1}{9}+\frac{1}{35}+\frac{1}{315}$.

It is known that we can we represent every rational number with odd denominator as a sum of distinct unit fractions with odd denominators.

However it is not known whether the greedy algorithm (http://planetmath.org/AnyRationalNumberIsASumOfUnitFractions) works when limited to odd denominators.

###### Conjecture 1.

For any fraction $0\leq\frac{a}{2k+1}<1$ with odd denominator, if we repeatedly subtract the largest unit fraction with odd denominator that is smaller than our fraction, we will eventually reach 0.

Title conjecture on fractions with odd denominators ConjectureOnFractionsWithOddDenominators 2013-03-22 12:48:34 2013-03-22 12:48:34 drini (3) drini (3) 9 drini (3) Conjecture msc 11D68 msc 11A67 SierpinskiErdosEgyptianFractionConjecture