Mohlo by se vám také líbit

Více informací o knize Diophantine Frobenius Problem

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 357 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Number theory

• Plný název: Diophantine Frobenius Problem
• Autor: Jorge L. Ramirez Alfonsin
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 260
• EAN: 9780198568209
• ISBN: 0198568207
• ID: 04527879
• Nakladatelství: Oxford University Press
• Hmotnost: 537 g
• Rozměry: 240 × 65 × 19 mm
• Datum vydání: 01. December 2005

Oblíbené z jiného soudku

---

---

---