Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Odd Greedy Expansion

Odd Greedy Expansion

Surhone, Lambert M.
Tennoe, Mariam T.
Henssonow, Susan F.

Paperback

General Mathematics

Currently unavailable to order

ISBN10: 613128959X
ISBN13: 9786131289590
Publisher: Vdm Verlag Dr Mller Ag & Co Kg
Pages: 112
Weight: 0.39
Height: 0.27 Width: 9.02 Depth: 6.00
Language: English
High Quality Content by WIKIPEDIA articles! In number theory, the odd greedy expansion problem concerns a method for forming Egyptian fractions in which all denominators are odd. However, there is a simpler greedy algorithm that 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 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 question of whether the odd greedy algorithm terminates with a finite expansion for every x/y with y odd (Guy 1981). As of 2006, this question remains open.

Also in

General Mathematics

View All