The Splitting Algorithm for Egyptian Fractions
- Published in 1991
- Added on
In the collection
The purpose of this paper is to answer a question raised by Stewart in 1964; we prove that the so-called splitting algorithm for Egyptian fractions based on the identity 1/x = 1/(x + 1) + 1/x(x + 1) terminates.
Links
Other information
- key
- TheSplittingAlgorithmforEgyptianFractions
- type
- article
- date_added
- 2018-09-20
- date_published
- 1991-10-09
BibTeX entry
@article{TheSplittingAlgorithmforEgyptianFractions, key = {TheSplittingAlgorithmforEgyptianFractions}, type = {article}, title = {The Splitting Algorithm for Egyptian Fractions}, author = {L. Beeckmans}, abstract = {The purpose of this paper is to answer a question raised by Stewart in 1964; we prove that the so-called splitting algorithm for Egyptian fractions based on the identity 1/x = 1/(x + 1) + 1/x(x + 1) terminates.}, comment = {}, date_added = {2018-09-20}, date_published = {1991-10-09}, urls = {https://www.sciencedirect.com/science/article/pii/S0022314X83710152?via{\%}3Dihub}, collections = {Easily explained}, url = {https://www.sciencedirect.com/science/article/pii/S0022314X83710152?via{\%}3Dihub}, year = 1991, urldate = {2018-09-20} }