Abstract
Let N(n) be the set of all integers that can be expressed as a sum of reciprocals of distinct integers <n. Then we prove that for sufficiently large n, log n + γ - (3/π2 + o(1)) log n (log n)/(log2 n)2 ≤ (n) , which improves the lower bound given by Croot.
| Original language | English |
|---|---|
| Pages (from-to) | 351-372 |
| Number of pages | 22 |
| Journal | Journal of Number Theory |
| Volume | 96 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2002 Oct 1 |
ASJC Scopus subject areas
- Algebra and Number Theory
Fingerprint Dive into the research topics of 'On the number of integers representable as sums of unit fractions, III'. Together they form a unique fingerprint.
Cite this
Yokota, H. (2002). On the number of integers representable as sums of unit fractions, III. Journal of Number Theory, 96(2), 351-372. https://doi.org/10.1016/S0022-314X(02)92797-6