conjecture on fractions with odd denominators
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.
For any fraction 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|
|Date of creation||2013-03-22 12:48:34|
|Last modified on||2013-03-22 12:48:34|
|Last modified by||drini (3)|