Approximation by Egyptian fractions and the weak greedy algorithm

DOI10.1016/j.indag.2023.05.008zbMath1523.11062arXiv2302.01747MaRDI QIDQ6057050

Hùng Viẹt Chu

Publication date: 25 October 2023

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.01747

zbMATH Keywords

sequencesgreedy algorithmEgyptian fraction

Mathematics Subject Classification ID

Rational numbers as sums of fractions (11D68) Irrationality; linear independence over a field (11J72) Calculation of integer sequences (11Y55)

Related Items (1)

A threshold for the best two-term underapproximation by Egyptian fractions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The best \(m\)-term approximation and greedy algorithms
• Underapproximation by Egyptian fractions
• Greedy approximation
• On representations by Egyptian fractions

This page was built for publication: Approximation by Egyptian fractions and the weak greedy algorithm