Abstract
We show that for large N every rational number a N ∈]0, 1[ has an egyptian fraction expansion a N = ∑ j=1 r 1 nj where r ≤ (1 + o(1)) log N log2N and nr ≤ 4N log2N log2N. This is essentially best possible.
Original language | English |
---|---|
Pages (from-to) | 150-156 |
Number of pages | 7 |
Journal | Journal of Number Theory |
Volume | 35 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1990 Jun |
ASJC Scopus subject areas
- Algebra and Number Theory