加载中…
We consider a generalization of the Frobenius Problem where the object of interest is the greatest integer which has exactly 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本