Length and denominators of egyptian fractions, III

Gérald Tenenbaum, Hisashi Yokota

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)150-156
Number of pages7
JournalJournal of Number Theory
Volume35
Issue number2
DOIs
Publication statusPublished - 1990
Externally publishedYes

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this

Length and denominators of egyptian fractions, III. / Tenenbaum, Gérald; Yokota, Hisashi.

In: Journal of Number Theory, Vol. 35, No. 2, 1990, p. 150-156.

Research output: Contribution to journalArticle

Tenenbaum, Gérald ; Yokota, Hisashi. / Length and denominators of egyptian fractions, III. In: Journal of Number Theory. 1990 ; Vol. 35, No. 2. pp. 150-156.
@article{63b82a1ac623479e985d8122b4687a60,
title = "Length and denominators of egyptian fractions, III",
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.",
author = "G{\'e}rald Tenenbaum and Hisashi Yokota",
year = "1990",
doi = "10.1016/0022-314X(90)90109-5",
language = "English",
volume = "35",
pages = "150--156",
journal = "Journal of Number Theory",
issn = "0022-314X",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Length and denominators of egyptian fractions, III

AU - Tenenbaum, Gérald

AU - Yokota, Hisashi

PY - 1990

Y1 - 1990

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

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

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

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

U2 - 10.1016/0022-314X(90)90109-5

DO - 10.1016/0022-314X(90)90109-5

M3 - Article

VL - 35

SP - 150

EP - 156

JO - Journal of Number Theory

JF - Journal of Number Theory

SN - 0022-314X

IS - 2

ER -