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

Hisashi Yokota

doi:10.1016/S0022-314X(02)92797-6

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

Hisashi Yokota

Systems Engineering and Science

Research output: Contribution to journal › Article › peer-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 + γ - (₃/^π2 + o(1)) log n (log n)/(log₂ n)² ≤ (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	https://doi.org/10.1016/S0022-314X(02)92797-6
Publication status	Published - 2002 Oct 1

ASJC Scopus subject areas

Algebra and Number Theory

Access to Document

10.1016/S0022-314X(02)92797-6

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

@article{53819ac86e1b4d32a0aa47b2ac6ae3ca,

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

abstract = "Let N(n) be the set of all integers that can be expressed as a sum of reciprocals of distinct integers 3/π2 + o(1)) log n (log n)/(log2 n)2 ≤ (n) , which improves the lower bound given by Croot.",

author = "Hisashi Yokota",

year = "2002",

month = oct,

day = "1",

doi = "10.1016/S0022-314X(02)92797-6",

language = "English",

volume = "96",

pages = "351--372",

journal = "Journal of Number Theory",

issn = "0022-314X",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

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

AU - Yokota, Hisashi

PY - 2002/10/1

Y1 - 2002/10/1

N2 - Let N(n) be the set of all integers that can be expressed as a sum of reciprocals of distinct integers 3/π2 + o(1)) log n (log n)/(log2 n)2 ≤ (n) , which improves the lower bound given by Croot.

AB - Let N(n) be the set of all integers that can be expressed as a sum of reciprocals of distinct integers 3/π2 + o(1)) log n (log n)/(log2 n)2 ≤ (n) , which improves the lower bound given by Croot.

UR - http://www.scopus.com/inward/record.url?scp=0036802669&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036802669&partnerID=8YFLogxK

U2 - 10.1016/S0022-314X(02)92797-6

DO - 10.1016/S0022-314X(02)92797-6

M3 - Article

AN - SCOPUS:0036802669

VL - 96

SP - 351

EP - 372

JO - Journal of Number Theory

JF - Journal of Number Theory

SN - 0022-314X

IS - 2

ER -