Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Diophantine Frobenius Problem

Name: Diophantine Frobenius Problem
Brand: Oxford University Press
SKU: 04527879
Price: 84496 HUF
Availability: InStock
Author: Jorge L. Ramirez Alfonsin
ISBN: 9780198568209

Jorge L. Ramirez Alfonsin

Language

English

Book Hardback

Libristo code: 04527879

Publishers Oxford University Press, December 2005

During the early part of the last century, Ferdinand Georg Frobenius (1849-1917) raised he following... Full description

Libristo code: 04527879

564 b

84 496 Ft

In stock at our supplier Shipping in 14-21 days

Up to 30 days for returns

Customers also purchased

Tod in der Krypta Stephanie Burbach

Paperback

3 264 Ft

Para Selena, con amor / To Selena, With Love Chris Perez

Paperback

5 990 Ft

Atlas der Kleintierchirurgie Thomas David

Hardback

53 698 Ft

Foerderung von hochbegabten Kindern und Jugendlichen Katharina Gorski

Paperback

6 410 Ft

Dvacet tisíc mil pod mořem Jules Verne

Hardback

3 642 Ft

Vorfelddelikte einer Individualrechtsgutsverletzung Kevin Kramer

Hardback

26 004 Ft

Druhá Barbora Sherf

Paperback

4 794 Ft

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.