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 Rdseth ([15]), Rosales and Garc\'ia-S\'anchez ([20]), and Tripathi ([26]).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.