An algorithm for the Product-Sum Equality
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915444012613632 |
|---|---|
| author | Husarov, Hlib Mayerhofer, Eberhard |
| author_facet | Husarov, Hlib Mayerhofer, Eberhard |
| contents | We propose a recursive algorithm for identifying all finite sequences of positive integers whose product equals their sum. Our method uses solutions of strictly shorter length that are iteratively extended in pursuit of a valid solution. The algorithm is efficient, with a time complexity similar to the quick sort algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_09647 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An algorithm for the Product-Sum Equality Husarov, Hlib Mayerhofer, Eberhard Number Theory 11A, 11D, 11Y We propose a recursive algorithm for identifying all finite sequences of positive integers whose product equals their sum. Our method uses solutions of strictly shorter length that are iteratively extended in pursuit of a valid solution. The algorithm is efficient, with a time complexity similar to the quick sort algorithm. |
| title | An algorithm for the Product-Sum Equality |
| topic | Number Theory 11A, 11D, 11Y |
| url | https://arxiv.org/abs/2508.09647 |