Underapproximation by Egyptian fractions

被引：3

作者：

Nathanson, Melvyn B. ^{[1
]}

机构：

[1] CUNY Lehman Coll, Dept Math, Bronx, NY 10468 USA

来源：

JOURNAL OF NUMBER THEORY | 2023年 / 242卷

关键词：

Egyptian fractions; Underapproximation; Sylvester?s sequence; Muirhead inequality; Greedy algorithm;

D O I：

10.1016/j.jnt.2022.07.005

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let 0 < theta <= 1. An increasing sequence (xi)ni=1 of positive integers is an n-term Egyptian underapproximation sequence of theta if Sigma n xi < theta. A greedy algorithm constructs an n-1 i=1 term underapproximation sequence of theta. For some but not all numbers theta, the greedy algorithm gives a unique best n-term underapproximation sequence for all n. An infinite set of rational numbers is constructed for which the greedy underapproximations are best, and numbers for which the greedy algorithm is not best are also studied.(c) 2022 Elsevier Inc. All rights reserved.

引用

页码：208 / 234

页数：27

共 11 条

[1]

Ambro F, 2015, REV ROUM MATH PURES, V60, P331

[2]

Curtis D.R., 1922, AM MATH MON, V29, P380

[3]

Erdos P., 1980, Monographies de L'Enseignement Mathematique, V28

[4]

Kellogg O.D., 1921, Am. Math. Mon., V28, P300

[5]

Miller GA, 1919, T AM MATH SOC, V20, P260

[6]

Nathanson MB, 2024, Arxiv, DOI arXiv:2201.01270

[7]

Neugebauer Otto., 1957, EXACT SCI ANTIQUITY, V2nd

[8]

Soundararajan K, 2005, Arxiv, DOI arXiv:math/0502247

[9]

Sylvester James J., 1880, Am. J. Math., V3, P332, DOI 10.2307/2369261

[10]

Takenouchi Tanzo, 1921, Proc. Phys.-Math. Soc. Japan, V3, P78

← 1 2 →