The splitting algorithm for Egyptian fractions
Let \(m/n=1/x_ 1+1/x_ 2+\dots+ 1/x_ L\) be a sum of unit fractions \(1/x_ k\), also known as Egyptian fractions (\(x_ k\), \(k=1,\dots,L\), are positive integers). The splitting algorithm acts as follows. If \(x_ k\) appears \(\mu>1\) times in the representation of \(m/n\), then \(\mu-1\) fractions \(1/x_ k\) will be replaced by the ``splitting identity \(1/x_ k=1/(x_ k+1)+1/x_ k(x_ k+1)\). The author calls this fraction \(1/x_ k\) pivot. He proves that there is a way so that the algorithm stops after a finite number of steps and that this number of steps and the set of fractions obtained at the end of the algorithm does not depend on the choice of the pivots.
- On the Egyptian method of decomposing 2/\(n\) into unit fractions
- Remarks on the ``greedy odd Egyptian fraction algorithm
- Remarks on the ``greedy odd Egyptian fraction algorithm. II
- The method of two partition of proper fraction
- scientific article; zbMATH DE number 4042004 (Why is no real title available?)
- Groupoid cardinality and Egyptian fractions
- An algorithm for Egyptian fraction representations with restricted denominators
- 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)
