Improved Yokota algorithm for Egyptian fractions

Abstract

The Yokota algorithm [Yok 88] is one of the existing algorithms for generating Egyptian fractions. It defines N_k as N_k = π_i=1^k S_i where S = (p^2klk≥ 0 and p is prime) and Si ith smallest element of S. In this paper we define N_k as N_k = π_i=1^k S_i <sup>and redesign the algorithm. We discuss the observed changes in the length and denominators of the resulting expansion.

Journal of the Nigerian Association of Mathematical Physics Vol. 9 2005: pp. 331-336</sup>