Könyv Diophantine Frobenius Problem Jorge L. Ramirez Alfonsin

Diophantine Frobenius Problem

Nyelv: Angol
Kötés: Kemény kötésű
Elérhetőség: Beszállítói készleten
Küldés 10-18 napon belül
55 379 Ft
During the early part of the last century, Ferdinand Georg Frobenius (1849-1917) raised he following...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Kemény kötésű
Kiadva
2005
oldal
260
EAN
9780198568209
ISBN
0198568207
Enbook ID
04527879
Súly
537
Méretek
65 x 240 x 19

Teljes leírás

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.

Érdekelheti

Control of Complex Systems

Aleksandar Zecevic
38 334 Ft
6 795 Ft

war in the United States

Ferdinand Lecomte
6 045 Ft

Filigree Ball

Anna Katherine Green
4 911 Ft

Shelter

Lauren Gilley
4 812 Ft
3 357 Ft

Planning for Learning

Valeri R Helterbran
9 402 Ft

Popular Tyranny

Kathryn A. Morgan
15 022 Ft

Easy Tarot Reading

Josephine Ellershaw
6 995 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Tod in der Krypta

Stephanie Burbach
3 085 Ft
50 781 Ft
3 170 Ft

Druhá

Barbora Sherf
4 670 Ft