2000 character limit reached
The Frobenius problem for four numerical semigroups
Published 28 Jun 2017 in math.NT | (1706.09246v3)
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 introduce the Frobenius problem for numerical semigroups generated by Thabit number base b and Thabit number of the second kind base b which are motivated by the Frobenius problem for Thabit numerical semigroups. Also, we introduce the Frobenius problem for numerical semigroups generated by Cunningham number and Fermat number base $b$
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.