The Largest Integer Expressible as a Sum of Reciprocal of Integers

Hisashi Yokota

Research output: Contribution to journalArticle

3 Citations (Scopus)

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 languageEnglish
Pages (from-to)206-216
Number of pages11
JournalJournal of Number Theory
Volume76
Issue number2
DOIs
Publication statusPublished - 1999 Jun
Externally publishedYes

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this

The Largest Integer Expressible as a Sum of Reciprocal of Integers. / Yokota, Hisashi.

In: Journal of Number Theory, Vol. 76, No. 2, 06.1999, p. 206-216.

Research output: Contribution to journalArticle

Yokota, Hisashi. / The Largest Integer Expressible as a Sum of Reciprocal of Integers. In: Journal of Number Theory. 1999 ; Vol. 76, No. 2. pp. 206-216.
@article{52f53c4457ad4d5fbf88e73f841f0741,
title = "The Largest Integer Expressible as a Sum of Reciprocal of Integers",
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.",
author = "Hisashi Yokota",
year = "1999",
month = "6",
doi = "10.1006/jnth.1998.2359",
language = "English",
volume = "76",
pages = "206--216",
journal = "Journal of Number Theory",
issn = "0022-314X",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - The Largest Integer Expressible as a Sum of Reciprocal of Integers

AU - Yokota, Hisashi

PY - 1999/6

Y1 - 1999/6

N2 - 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.

AB - 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.

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

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

U2 - 10.1006/jnth.1998.2359

DO - 10.1006/jnth.1998.2359

M3 - Article

AN - SCOPUS:0011080214

VL - 76

SP - 206

EP - 216

JO - Journal of Number Theory

JF - Journal of Number Theory

SN - 0022-314X

IS - 2

ER -