The general problem
This chapter provides a systematic exposition of the known formulas, including upper and lower bounds for g(a1, . . . , an) for general n, and for special sequences (for instance, when a1, . . . , an forms an arithmetic sequence). Results on the change in value of g(a1, . . . , an), when an additional element an + 1 is inserted, are also given.
Keywords: Frobenius number, upper bounds, lower bounds, arithmetic sequences
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .