The Frobenius number corresponding to the squares of three consecutive Fibonacci numbers: comparison of three algorithmic processes
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915369644457984 |
|---|---|
| author | Robles-Pérez, Aureliano M. Rosales, José Carlos |
| author_facet | Robles-Pérez, Aureliano M. Rosales, José Carlos |
| contents | We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ramírez Alfonsín and Rødseth ([15]), Rosales and García-Sánchez ([20]), and Tripathi ([26]). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_01898 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Frobenius number corresponding to the squares of three consecutive Fibonacci numbers: comparison of three algorithmic processes Robles-Pérez, Aureliano M. Rosales, José Carlos Number Theory Group Theory 11D07, 20M13, 20M14 We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ramírez Alfonsín and Rødseth ([15]), Rosales and García-Sánchez ([20]), and Tripathi ([26]). |
| title | The Frobenius number corresponding to the squares of three consecutive Fibonacci numbers: comparison of three algorithmic processes |
| topic | Number Theory Group Theory 11D07, 20M13, 20M14 |
| url | https://arxiv.org/abs/2507.01898 |