Approximation by Egyptian Fractions and the Weak Greedy Algorithm

Hung Viet Chu

Let $0<\theta ⩽1$. A sequence of positive integers $(b_n{)}_{n=1}^{\infty }$ is called a weak greedy approximation of $\theta$ if ${\sum }_{n=1}^{\infty }1/b_n=\theta$. We introduce the weak g…