Improved Yokota algorithm for Egyptian fractions
The Yokota algorithm [Yok 88] is one of the existing algorithms for generating Egyptian fractions. It defines Nk as Nk = πi=1k Si where S = (p2klk≥ 0 and p is prime) and Si ith smallest element of S. In this paper we define Nk as Nk = πi=1k Si 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
Copyrights is owned by the Nigerian Association of Mathematical Physics