Gå direkte til innholdet
Computational Excursions in Analysis and Number Theory
Spar

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.
Forfatter
Peter Borwein
Opplag
Softcover reprint of the original 1st ed. 2002
ISBN
9781441930002
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
3.12.2010
Antall sider
220