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

[摘要] Let N(n) be the set of all integers that can be expressed as a sum of reciprocals of distinct integers less than or equal ton. Then we prove that for sufficiently large n, log n + gamma - (pi(2)/3 + o(1) (log(2) n)(2)/log n less than or equal to\N(n)\, which improves the lower bound given by Croot. (C) 2002 Elsevier Science (USA).

[发布日期] 2002-10-01