We say that an algorithm which could yield a short unit fraction expansion in which the denominators do not get too large is an ideal expansion. It is shown that Bleicher and Erdös algorithm can be modified to be an ideal algorithm.
|Number of pages||10|
|Journal||Journal of Number Theory|
|Publication status||Published - 1986 Nov|
ASJC Scopus subject areas
- Algebra and Number Theory