株式会社極東書店トップ商品一覧The Diophantine Frobenius Problem.

商品詳細

The Diophantine Frobenius Problem.

The Diophantine Frobenius Problem.

・ISBN 978-0-19-856820-9 hard GB£ 155.00

¥49,104.- (税込) (※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。

お気に入り

電子版あり 大学・学術機関向け電子ブック(eBook)ISBN 978-0-19-171822-9

著者・編者Ram?irez Alfons?in, Jorge L.,
シリーズOxford Lecture Series in Mathematics and Its Applications
出版社(Oxford University Press, UK)
出版年月2005
ページ数260 pp.
言語ENG
ニュース番号<M25-372>

解説

During the early part of the last century, Ferdinand Georg Frobenius (1849-1917) raised he 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, . At first glance FP may look deceptively specialized. Nevertheless it crops up again and again in the most unexpected places and has been extremely useful in investigating many different problems. 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.