抄録
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.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 249-258 |
| ページ数 | 10 |
| ジャーナル | Journal of Number Theory |
| 巻 | 24 |
| 号 | 3 |
| DOI | |
| 出版ステータス | Published - 1986 11 |
| 外部発表 | はい |
ASJC Scopus subject areas
- 代数と数論