UnboundedFigures
UnboundedFigures
← Project Lab
🔒 Private · invite onlyActive

[Demo] Mei's notebook: greedy expansions

Mission

Collect examples where the greedy algorithm for Egyptian fractions is far from the shortest expansion.

Mei's private notes on where the greedy algorithm for Egyptian fractions does badly.

egyptian-fractionsgreedy-algorithm
D
Led by Mei Tanaka (demo)·2 figures inside

This project is private. Only invited collaborators can see the research log, paper, and discussion. You can see its mission, and you can ask to be notified when the project is finished.

Sign in to get notified

Have an invite link? Open it to join and see the full project.