Length and denominators of Egyptian fractions

Hisashi Yokota

doi:10.1016/0022-314X(86)90033-8

Length and denominators of Egyptian fractions

Hisashi Yokota

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	249-258
Number of pages	10
Journal	Journal of Number Theory
Volume	24
Issue number	3
DOIs	https://doi.org/10.1016/0022-314X(86)90033-8
Publication status	Published - 1986 Nov
Externally published	Yes

ASJC Scopus subject areas

Algebra and Number Theory

Access to Document

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

Cite this

@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",

month = nov,

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/11

Y1 - 1986/11

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

AN - SCOPUS:46149131137

SN - 0022-314X

VL - 24

SP - 249

EP - 258

JO - Journal of Number Theory

JF - Journal of Number Theory

IS - 3

ER -

Length and denominators of Egyptian fractions

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this