Abstract
We establish and prove polynomial formulas for the Frobenius numbers of numerical semigroups generated by \(n^2, (n+1)^2, (n+2)^2\) and by \(n^3, (n+1)^3, (n+2)^3\). The formulas depend on the residue class of \(n\) modulo 4 and 18, respectively.
Similar content being viewed by others
References
Curtis, F.: On formulas for the Frobenius number of a numerical semigroup. Math. Scand. 67, 190–192 (1990)
Dutch, K., Rickett, C.: Conductors for sets of large integers squares. Notes Number Theory Discret. Math. 18, 16–21 (2012)
Marıin, J.M., Ramıirez Alfonsín, J.L., Revuelta, M.P.: On the Frobenius number of Fibonacci numerical semigroups. Integers 7, 7 (2007)
Ong, D.C., Ponomarenko, V.: The Frobenius number of geometric sequences. Integers 8, 3 (2008)
Ramírez Alfonsín, J.L.: Complexity of the Frobenius problem. Combinatorica 16, 143–147 (1996)
Ramírez Alfonsín, J.L.: The Diophantine Frobenius Problem. Oxford Lecture Series in Mathematics and its Applications, vol. 30. Oxford University Press, Oxford (2005)
Roberts, J.B.: Note on linear forms. Proc. Am. Math. Soc. 7, 465–469 (1956)
Rødseth, Ø.J.: On a linear Diophantine problem of Frobenius. J. Reine Angew. Math. 301, 171–178 (1978)
Ramírez Alfonsín, J.L., Rødseth, Ø.J.: Numerical semigroups: Apéry sets and Hilbert series. Semigroup Forum 79, 323–340 (2009)
Sylvester, J.J.: Mathematical questions with their solution. Educ. Times 41, 21 (1884)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Fernando Torres.
Rights and permissions
About this article
Cite this article
Lepilov, M., O’Rourke, J. & Swanson, I. Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes. Semigroup Forum 91, 238–259 (2015). https://doi.org/10.1007/s00233-014-9687-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00233-014-9687-8