ON EVENTUALLY GREEDY BEST UNDERAPPROXIMATIONS BY EGYPTIAN FRACTIONS

作     者：Kovač, Vjekoslav 

作者机构：Department of Mathematics Faculty of Science University of Zagreb Bijenička cesta 30 Zagreb10000 Croatia 

出 版 物：《arXiv》 (arXiv)

年 卷 期：2024年

核心收录：

主　　题：Consensus algorithm 

摘      要：Erdős and Graham found it conceivable that the best n-term Egyptian underapproximation of almost every positive number for sufficiently large n gets constructed in a greedy manner, i.e., from the best (n−1)-term Egyptian underapproximation. We show that the opposite is true: the set of real numbers with this property has Lebesgue measure zero. Copyright © 2024, The Authors. All rights reserved.