Length and denominators of Egyptian fractions

Hisashi Yokota

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We say that an algorithm which could yield a short unit fraction expansion in which the denominators do not get too large is an ideal expansion. It is shown that Bleicher and Erdös algorithm can be modified to be an ideal algorithm.

Original languageEnglish
Pages (from-to)249-258
Number of pages10
JournalJournal of Number Theory
Volume24
Issue number3
DOIs
Publication statusPublished - 1986
Externally publishedYes

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this

Length and denominators of Egyptian fractions. / Yokota, Hisashi.

In: Journal of Number Theory, Vol. 24, No. 3, 1986, p. 249-258.

Research output: Contribution to journalArticle

Yokota, Hisashi. / Length and denominators of Egyptian fractions. In: Journal of Number Theory. 1986 ; Vol. 24, No. 3. pp. 249-258.
@article{8946c687a9f848af81238687ab08d949,
title = "Length and denominators of Egyptian fractions",
abstract = "We say that an algorithm which could yield a short unit fraction expansion in which the denominators do not get too large is an ideal expansion. It is shown that Bleicher and Erd{\"o}s algorithm can be modified to be an ideal algorithm.",
author = "Hisashi Yokota",
year = "1986",
doi = "10.1016/0022-314X(86)90033-8",
language = "English",
volume = "24",
pages = "249--258",
journal = "Journal of Number Theory",
issn = "0022-314X",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - Length and denominators of Egyptian fractions

AU - Yokota, Hisashi

PY - 1986

Y1 - 1986

N2 - We say that an algorithm which could yield a short unit fraction expansion in which the denominators do not get too large is an ideal expansion. It is shown that Bleicher and Erdös algorithm can be modified to be an ideal algorithm.

AB - We say that an algorithm which could yield a short unit fraction expansion in which the denominators do not get too large is an ideal expansion. It is shown that Bleicher and Erdös algorithm can be modified to be an ideal algorithm.

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

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

U2 - 10.1016/0022-314X(86)90033-8

DO - 10.1016/0022-314X(86)90033-8

M3 - Article

VL - 24

SP - 249

EP - 258

JO - Journal of Number Theory

JF - Journal of Number Theory

SN - 0022-314X

IS - 3

ER -