The splitting algorithm for Egyptian fractions

DOI10.1006/JNTH.1993.1015MaRDI QIDQ1208183zbMATH OpenOpenAlexWikidataFDO

Authors Laurent Beeckmans

Publication date 16 May 1993

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jnth.1993.1015

zbMATH Keywords

Egyptian fractionssum of unit fractionsmultisetspivot-fractionssplitting identity

Mathematics Subject Classification ID

Continued fractions (11A55) Rational numbers as sums of fractions (11D68)

Recommendations

• scientific article; zbMATH DE number 3619971
• Length and denominators of Egyptian fractions
• Remarks on the ``greedy odd Egyptian fraction algorithm
• Remarks on the ``greedy odd Egyptian fraction algorithm. II
• Length and denominators of Egyptian fractions. II

Cited in

(7)

• On the Egyptian method of decomposing 2/\(n\) into unit fractions
• Remarks on the ``greedy odd Egyptian fraction algorithm
• The method of two partition of proper fraction
• Groupoid cardinality and Egyptian fractions
• scientific article; zbMATH DE number 4042004 (Why is no real title available?)
• Remarks on the ``greedy odd Egyptian fraction algorithm. II
• An Egyptian algorithm for polynomials

This page was built for publication: The splitting algorithm for Egyptian fractions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208183)