Cover of: The diophantine Frobenius problem | Jorge L. RamiМЃrez Alfonsin Read Online
Share

The diophantine Frobenius problem by Jorge L. RamiМЃrez Alfonsin

  • 871 Want to read
  • ·
  • 87 Currently reading

Published by Oxford University Press in New York .
Written in English

Subjects:

  • Frobenius algebras.,
  • Frobenius groups.,
  • Diophantine analysis.

Book details:

Edition Notes

Includes bibliographical references and index.

StatementJ.L. Ramírez Alfonsín.
Classifications
LC ClassificationsQA251.5 .R36 2005
The Physical Object
Paginationp. cm.
ID Numbers
Open LibraryOL3404244M
ISBN 100198568207
ISBN 109780198568209
LC Control Number2005019571

Download The diophantine Frobenius problem

PDF EPUB FB2 MOBI RTF

During the early part of the last century, Ferdinand Georg Frobenius () raised the following problem, known as the Frobenius Problem (FP): given relatively prime positive integers a1,,an, find the largest natural number (called the Frobenius number and denoted by g(a1,,an) that is Price: $ Preface During the early part of the last century, Ferdinand Georg Frobenius () raised, in his lec- tures (according to), the following problem (called the Frobenius Problem FP): given relatively prime positive integers a 1,,a n, find the largest natural number (called the Frobenius number and denoted by g(a. During the early part of the last century, Ferdinand Georg Frobenius () raised the following problem, known as the Frobenius Problem (FP): given relatively prime positive integers a1, an, find the largest natural number (called the Frobenius number and denoted by g(a1, an) that is not representable as a nonnegative integer combination of a1, an. A number of methods, from several areas of mathematics, have been used in the hope of finding a formula giving the Frobenius number and algorithms to calculate it. The main intention of this book is to highlight such methods, ideas, viewpoints and applications to a broader audience.

During the early part of the last century, Ferdinand Georg Frobenius () raised the following problem, known as the Frobenius Problem (FP): given relatively prime positive integers a1,,an, find the largest natural number (called the Frobenius number and denoted by g(a1,,an) that is not representable as a nonnegative integer combination of a1,, first glance FB may look deceptively. A DIOPHANTINE FROBENIUS PROBLEM RELATED TO RIEMANN SURFACES CORMAC O’SULLIVAN and ANTHONY WEAVER Department of Mathematics and Computer Science, Bronx Community College, City University of New York, University Avenue, Bronx, New York , USA.   The diophantine problem of Frobenius Proof. Finding a minimal a in (1) is an integer linear problem. In order to find the values of a;, 1, we have to solve n such problems. Thus, using Lenstra's polynomial algorithm for the integer linear programming, we can compute the bound B in polynomial-time when n is fixed. 0 Remark. nconstitutes the so-called diophantine Frobenius problem. We recommend, printed in , as a comprehensive source of material about this problem; the bibliography alone contains about items. The case n = 2 was first considered and solved by Sylvester,. He proved: Proposition 1.

: The Diophantine Frobenius Problem (Oxford Lecture Series in Mathematics and Its Applications) () by Ramírez Alfonsín, Jorge L. and a great selection of similar New, Used and Collectible Books available now at great prices. The Diophantine Frobenius Problem (Oxford Lecture Series in Mathematics and Its Applications Book 30) eBook: Alfonsín, Jorge L. Ramírez: : Kindle StoreAuthor: Jorge L. Ramírez Alfonsín. Boston University Libraries. Services. Navigate; Linked Data; Dashboard; Tools / Extras; Stats; Share. Social. Mail.   In this paper, linear diophantine problem of Frobenius is discussed. A theorem concerning the largest integer g m (a 1,a 2) and the smallest integer G m (a 1,a 2) with m different representations with a 1,a 2 as basis is proved.