Underapproximation by Egyptian fractions

DOI10.1016/j.jnt.2022.07.005OpenAlexW4292379800WikidataQ114156428 ScholiaQ114156428MaRDI QIDQ2079483

Melvyn B. Nathanson

Publication date: 30 September 2022

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

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

zbMATH Keywords

greedy algorithmMuirhead inequalityEgyptian fractionsunderapproximationSylvester's sequence

Mathematics Subject Classification ID

Diophantine inequalities (11D75) Diophantine equations in many variables (11D72) Rational numbers as sums of fractions (11D68) Other number representations (11A67) Additive number theory; partitions (11P99) Representation problems (11D85)

Related Items (2)

Approximation by Egyptian fractions and the weak greedy algorithm ⋮ A threshold for the best two-term underapproximation by Egyptian fractions

Cites Work

• On representations by Egyptian fractions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Underapproximation by Egyptian fractions