Abstract
LetM(n) be the largest integer that can be expressed as a sum of the reciprocal of distinct integers ≤n. Then for somec1,c2>0, log n+γ-2-(c1/log2 n)≤M(n)≤logn+γ-(c2/log2 n), which answers a question of Erdos.
Original language | English |
---|---|
Pages (from-to) | 206-216 |
Number of pages | 11 |
Journal | Journal of Number Theory |
Volume | 76 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1999 Jun |
Externally published | Yes |
ASJC Scopus subject areas
- Algebra and Number Theory