On a Generalization of the Frobenius Number
classification
🧮 math.NT
keywords
frobeniusgeneralizationanaloguebrauercollectioncomputationconsiderexactly
read the original abstract
We consider a generalization of the Frobenius Problem where the object of interest is the greatest integer which has exactly $j$ representations by a collection of positive relatively prime integers. We prove an analogue of a theorem of Brauer and Shockley and show how it can be used for computation.
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.