Splitting Algorithm

A method for computing a Unit Fraction. This method always terminates (Beeckmans 1993).

References

Beeckmans, L. ``The Splitting Algorithm for Egyptian Fractions.'' J. Number Th. 43, 173-185, 1993.

• Long Prime
• Look and Say Sequence
• Loop (Algebra)
• Loop Gain
• Loop (Graph)
• Loop (Knot)
• Loop Space
• Lorentz Group
• Lorentzian Distribution
• Lorentzian Function
• Lorentz Tensor
• Lorentz Transformation
• Lorenz System
• Lorraine Cross
• Lo Shu
• Lotka-Volterra Equations
• Low-Dimensional Topology
• Lower Bound
• Lower Denjoy Sum
• Lower Integral
• Lower Limit
• Lower Sum
• Lower-Trimmed Subsequence
• Lowest Terms Fraction
• Loxodrome