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

DOI10.1016/j.indag.2024.01.006arXiv2306.12564WikidataQ129496965 ScholiaQ129496965MaRDI QIDQ6130566

Hùng Viẹt Chu

Publication date: 3 April 2024

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

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

zbMATH Keywords

sequencesgreedy algorithmEgyptian fraction

Mathematics Subject Classification ID

Rational numbers as sums of fractions (11D68) Calculation of integer sequences (11Y55)

Cites Work

• Underapproximation by Egyptian fractions
• EGYPTIAN FRACTIONS WITH ODD DENOMINATORS
• Egyptian fractions with restrictions
• Dense Egyptian fractions
• Sums of four and more unit fractions and approximate parametrizations
• Egyptian Fractions with Denominators from Sequences Closed Under Doubling
• On the exceptional set for binary Egyptian fractions
• On representations by Egyptian fractions
• Approximation by Egyptian fractions and the weak greedy algorithm
• Unnamed Item

This page was built for publication: A threshold for the best two-term underapproximation by Egyptian fractions