On the number of integers representable as sums of unit fractions, III

Hisashi Yokota

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)351-372
Number of pages22
JournalJournal of Number Theory
Volume96
Issue number2
DOIs
Publication statusPublished - 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