Source: wikibot/greedy-algorithm-for-egyptian-fractions
= Greedy algorithm for Egyptian fractions
{wiki=Greedy_algorithm_for_Egyptian_fractions}
The Greedy algorithm for representing a fraction as an Egyptian fraction is a method that breaks down a given fraction into a sum of distinct unit fractions, where a unit fraction is a fraction of the form \\( \\frac\{1\}\{n\} \\) for some positive integer \\( n \\). An Egyptian fraction is thus a sum of such fractions.