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.
exciting and informational.
Ср, 02/29/2012 - 15:14 — juliarobertThis is a fantastic site and very engaging too. Excellent work! That’s not really much coming from an amateur publisher like me, but it’s all I could think after enjoying your posts. Not like other site. You really know what you’re talking about too. So much that you made me want to explore more. Your blog has become a stepping stone for me, my friend. Thanks for the detailed journey. I really enjoyed the posts that I have read.......................
98-366 // mb2-632 // mb6-819 // 70-292 // 70-541 // 70-557 //