An algorithm for Egyptian fraction representations with restricted denominators
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912205721567232 |
|---|---|
| author | Martin, Greg Shi, Yue |
| author_facet | Martin, Greg Shi, Yue |
| contents | A unit fraction representation of a rational number $r$ is a finite sum of reciprocals of positive integers that equals $r$. Of particular interest is the case when all denominators in the representation are distinct, resulting in an Egyptian fraction representation of $r$. Common algorithms for computing Egyptian fraction representations of a given rational number tend to result in extremely large denominators and cannot be adapted to restrictions on the allowed denominators. We describe an algorithm for finding all unit fraction representations of a given rational number using denominators from a given finite multiset of positive integers. The freely available algorithm, implemented in Scheme, is particularly well suited to computing dense Egyptian fraction representations, where the allowed denominators have a prescribed maximum. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2107_05076 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | An algorithm for Egyptian fraction representations with restricted denominators Martin, Greg Shi, Yue Number Theory 11D68 (Primary) 11D72 (Secondary) A unit fraction representation of a rational number $r$ is a finite sum of reciprocals of positive integers that equals $r$. Of particular interest is the case when all denominators in the representation are distinct, resulting in an Egyptian fraction representation of $r$. Common algorithms for computing Egyptian fraction representations of a given rational number tend to result in extremely large denominators and cannot be adapted to restrictions on the allowed denominators. We describe an algorithm for finding all unit fraction representations of a given rational number using denominators from a given finite multiset of positive integers. The freely available algorithm, implemented in Scheme, is particularly well suited to computing dense Egyptian fraction representations, where the allowed denominators have a prescribed maximum. |
| title | An algorithm for Egyptian fraction representations with restricted denominators |
| topic | Number Theory 11D68 (Primary) 11D72 (Secondary) |
| url | https://arxiv.org/abs/2107.05076 |