|
|||||
|
|
Length and denominators of Egyptian fractions |
|
| Affiliation: | Department of Mathematics, South Dakota State University, Brookings, South Dakota 57007 USA |
| Abstract: | 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. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |