arXiv · 2507.01898
The Frobenius number corresponding to the squares of three consecutive Fibonacci numbers: comparison of three algorithmic processes
Abstract
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\'irez Alfons\'in and R{\o}dseth ([15]), Rosales and Garc\'ia-S\'anchez ([20]), and Tripathi ([26]).
Explore related subjects
Keep this discovery
Aureliano M. Robles-Pérez, José Carlos Rosales. 2025-07-02. The Frobenius number corresponding to the squares of three consecutive Fibonacci numbers: comparison of three algorithmic processes. https://arxiv.org/abs/2507.01898
Cite the original work for its findings. Save a collection to share your selection of sources.