The Frobenius problem for shifted square sequences starting with a multiple of 4
classification
🧮 math.NT
keywords
frobeniusproblemcalledmultiplenumbersequencesshiftedsquare
read the original abstract
The greatest integer that does not belong to a numerical semigroup S is called the Frobenius number of S, and finding the Frobenius number is called the Frobenius problem. In this paper, we solve the Frobenius problem for shifted square sequences starting with a multiple of 4.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.