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:

    Were I as base as is the lowly plain,
    And you, my Love, as high as heaven above,
    Yet should the thoughts of me, your humble swain,
    Ascend to heaven in honour of my love.
    —Joshua Sylvester (1561–1618)

    Reminiscences, even extensive ones, do not always amount to an autobiography.... For autobiography has to do with time, with sequence and what makes up the continuous flow of life. Here, I am talking of a space, of moments and discontinuities. For even if months and years appear here, it is in the form they have in the moment of recollection. This strange form—it may be called fleeting or eternal—is in neither case the stuff that life is made of.
    Walter Benjamin (1892–1940)

    Writing books is the closest men ever come to childbearing.
    Norman Mailer (b. 1923)