Jump to ContentJump to Main Navigation
The Diophantine Frobenius Problem$
Users without a subscription are not able to see the full content.

Jorge L. Ramírez Alfonsín

Print publication date: 2005

Print ISBN-13: 9780198568209

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198568209.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 16 July 2019

Generalizations and related problems

Generalizations and related problems

Chapter:
(p.119) 6 Generalizations and related problems
Source:
The Diophantine Frobenius Problem
Author(s):

J. L. Ramírez Alfonsín

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198568209.003.0006

Let g(n, t) and h(n, t) be the largest and smallest of three of the Frobenius numbers when a1 < · · · < an = t and t = a1 < · · · < an, respectively. This chapter reviews the results on these functions. It also examines an algorithm that solves the modular change problem, a generalization of FP, due to Z. Skupień, describes the relation between FP and (a1, . . . , an)-trees, discusses the postage stamp problem, as well as a multidimensional generalization of FP.

Keywords:   Frobenius number, algorithm, modular change problem, Z. Skupień, postage stamp problem

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 .