On representations by Egyptian fractions
From MaRDI portal
Publication:5367203
Abstract: We give a sharp upper bound for the entries of the representations of a rational number as a sum of Egyptian fractions.
Cited in
(7)- A note on fraction decompositions of integers
- scientific article; zbMATH DE number 3225318 (Why is no real title available?)
- Underapproximation by Egyptian fractions
- Approximation by Egyptian fractions and the weak greedy algorithm
- On the Egyptian method of decomposing 2/\(n\) into unit fractions
- On the exceptional set for binary Egyptian fractions
- A threshold for the best two-term underapproximation by Egyptian fractions
This page was built for publication: On representations by Egyptian fractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367203)