Upper Limit of Number of Unit Fractions to express Proper Fraction from Greedy Algorithm/Historical Note

Historical Note on Upper Limit of Number of Unit Fractions to express Proper Fraction from Greedy Algorithm
This result was proved by in $1880$.