The greedy algorithm for Egyptian fractions, first described in 1202 by Fibonacci in his book Liber Abaci, finds an expansion in which each successive term is the largest unit fraction that is no larger than the remaining number to be represented.
Domnevo sta formulirala leta 1948 Paul Erdős in Ernst Gabor Straus.