Greedy Algorithm For Egyptian Fractions - Sylvester's Sequence and Closest Approximation

Sylvester's Sequence and Closest Approximation

Sylvester's sequence 2, 3, 7, 43, 1807, ... can be viewed as generated by an infinite greedy expansion of this type for the number one, where at each step we choose the denominator instead of . Truncating this sequence to k terms and forming the corresponding Egyptian fraction, e.g. (for k = 4)

results in the closest possible underestimate of 1 by any k-term Egyptian fraction (Curtiss 1922; Soundararajan 2005). That is, for example, any Egyptian fraction for a number in the open interval (1805/1806,1) requires at least five terms. Curtiss (1922) describes an application of these closest-approximation results in lower-bounding the number of divisors of a perfect number, while Stong (1983) describes applications in group theory.

Read more about this topic:  Greedy Algorithm For Egyptian Fractions

Famous quotes containing the words sylvester, sequence and/or closest:

    On this I ponder where’er I wander,
    And thus grow fonder, sweet Cork, of thee;
    With thy bells of Shandon,
    —Francis Sylvester Mahony (1805–1866)

    It isn’t that you subordinate your ideas to the force of the facts in autobiography but that you construct a sequence of stories to bind up the facts with a persuasive hypothesis that unravels your history’s meaning.
    Philip Roth (b. 1933)

    ... a business career for a woman and her need for a woman’s life as wife and mother, are not enemies at all, unless we make them so, but may be the closest and most co-operative friends and supporter of each other.
    Hortense Odlum (1892–?)