Upper Limit of Number of Unit Fractions to express Proper Fraction from Greedy Algorithm/Historical Note
Jump to navigation
Jump to search
Historical Note on Upper Limit of Number of Unit Fractions to express Proper Fraction from Greedy Algorithm
This result was proved by James Joseph Sylvester in $1880$.
Sources
- 1992: David Wells: Curious and Interesting Puzzles ... (previous) ... (next): Egyptian Fractions