Siirry suoraan sisältöön
Computational Excursions in Analysis and Number Theory
Tallenna

Computational Excursions in Analysis and Number Theory

Find a polynomial of degree n with eoeffieients in the set { + 1, -I} that has smallest possible supremum norm on the unit disko The Prouhet-Tarry-Escott Problem. The techniques for tackling these problems are various and include proba­ bilistic methods, combinatorial methods, "the circle method," and Diophantine and analytic techniques.
Kirjailija
Peter Borwein
Painos
Softcover reprint of the original 1st ed. 2002
ISBN
9781441930002
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
3.12.2010
Sivumäärä
220