Abstract
An improved Fibonacci-Sylvester algorithm for computing unit fraction expansions is presented. In general, the maximal denominators computed by this new algorithm are comparatively smaller than those obtained by the original algorithm. Discussions of its implementation in computer algebra systems, comparison of tested results, ideas for further research and its applications in undergraduate teaching are included. Copyright © 2007 World Scientific Publishing.
| Original language | English |
|---|---|
| Title of host publication | Symbolic computation and education |
| Editors | Shangzhi LI, Dongming WANG , Jing-Zhong ZHANG |
| Place of Publication | Singapore |
| Publisher | World Scientific Publishing |
| Pages | 206-217 |
| ISBN (Print) | 9789812775993, 9812775994 |
| Publication status | Published - 2007 |
Citation
Man, Y.-K. (2007). Computer algebra meets an ancient Egyptian problem. In S. Li, D. Wong, & J.-Z. Zhang (Eds.), Symbolic computation and education (pp. 206-217). Singapore: World Scientific Publishing.Keywords
- Unit fraction
- Improved fibonacci-sylvester algorithm
- Computer algebra