
TL;DR
This paper investigates the number of solutions to the Egyptian fractions equation with odd denominators, providing new bounds that significantly improve previous estimates, especially for odd values of k.
Contribution
It establishes new double-exponential bounds on the number of solutions with odd denominators, advancing understanding of the solution count for these specific Egyptian fractions.
Findings
For odd k, the number of solutions S(k) is bounded between double-exponential functions.
The bounds are tighter than previous estimates, especially improving the lower bound.
The results reveal rapid growth in the number of solutions as k increases.
Abstract
The number of solutions of the diophantine equation in particular when the are distinct odd positive integers is investigated. The number of solutions in this case is, for odd : \[\exp \left( \exp \left( c_1\, \frac{k}{\log k}\right)\right) \leq S(k) \leq \exp \left( \exp \left(c_2\, k \right)\right) \] with some positive constants and . This improves upon an earlier lower bound of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
