A new algorithm for the expansion of Egyptian fractions

DOI10.1016/0022-314X(72)90069-8zbMath0243.10024MaRDI QIDQ2554354

Michael N. Bleicher

Publication date: 1972

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

Mathematics Subject Classification ID

Continued fractions and generalizations (11J70) Diophantine inequalities (11D75) Radix representation; digital problems (11A63)

Related Items (7)

Length and denominators of Egyptian fractions ⋮ Groupoid Cardinality and Egyptian Fractions ⋮ Unnamed Item ⋮ On Egyptian fractions of length 3 ⋮ Denominators of Egyptian fractions ⋮ Bounding the number of arithmetical structures on graphs ⋮ Partitions, Egyptian Fractions, and Free Products of Finite Abelian Groups

Cites Work

• On finite sums of reciprocals of distinct \(n\)th powers
• Approximate formulas for some functions of prime numbers
• On the reciprocal of integers
• Zur Lösung der diopantischen Gleichung , insbesondere im Fall m = 4.
• On the representation of rational numbers as a sum of a fixed number of unit fractions.
• Sums of Fractions with Bounded Numerators
• Brüche als Summe von Stammbrüchen.
• Sums of Distinct Unit Fractions
• On Finite Sums of Unit Fractions
• Reciprocal Bases for the Integers
• The Approximation of Numbers as Sums of Reciprocals
• Futher Remarks on the Approximation of Numbers as Sums of Reciprocals
• Sums of Distinct Divisors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new algorithm for the expansion of Egyptian fractions