Vendeur : Attic Books (ABAC, ILAB), London, ON, Canada
EUR 44,43
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Near fine. CMS Books in Mathematics. x, 220 p. 24 cm. Ink signature on first leaf.
Edité par Canadian Mathematical Society; Springer, 2002
ISBN 10 : 0387954449 ISBN 13 : 9780387954448
Vendeur : Attic Books (ABAC, ILAB), London, ON, Canada
EUR 26,66
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : ex library-good. CMS Books in Mathematics 10. x, 220 p. 24 cm. B&w illustrations. Ex library with labels on spine and front cover. Ink stamps on top edge and title.
Vendeur : Hourglass Books, Vancouver, BC, Canada
EUR 71,09
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Very Good+. American First. Complete number line from 1 to 9; minor wear; otherwise a solid, clean copy with no marking or underlining; collectible condition. Book.
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
EUR 78,99
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Vendeur : ALLBOOKS1, Direk, SA, Australie
EUR 93,69
Quantité disponible : 1 disponible(s)
Ajouter au panierBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 90,77
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 236.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 95,28
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 236 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 104,33
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 103,14
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 103,47
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 96,22
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 236.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 110,04
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 110,03
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 121,73
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
EUR 95,80
Quantité disponible : 5 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Computational Excursions in Analysis and Number Theory | Peter Borwein | Taschenbuch | x | Englisch | 2010 | Humana | EAN 9781441930002 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Edité par Springer New York, Springer US Jul 2002, 2002
ISBN 10 : 0387954449 ISBN 13 : 9780387954448
Langue: anglais
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 106,99
Quantité disponible : 2 disponible(s)
Ajouter au panierBuch. Etat : Neu. Neuware -This book is designed for a topics course in computational number theory. It is based around a number of difficult old problems that live at the interface of analysis and number theory. Some of these problems are the following: The Integer Chebyshev Problem. Find a nonzero polynomial of degree n with integer eoeffieients that has smallest possible supremum norm on the unit interval. Littlewood's Problem. 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. Find a polynomial with integer co effieients that is divisible by (z - l)n and has smallest possible 1 norm. (That 1 is, the sum of the absolute values of the eoeffieients is minimal.) Lehmer's Problem. Show that any monie polynomial p, p(O) i- 0, with in teger coefficients that is irreducible and that is not a cyclotomic polynomial has Mahler measure at least 1.1762 . All of the above problems are at least forty years old; all are presumably very hard, certainly none are completely solved; and alllend themselves to extensive computational explorations. The techniques for tackling these problems are various and include proba bilistic methods, combinatorial methods, 'the circle method,' and Diophantine and analytic techniques. Computationally, the main tool is the LLL algorithm for finding small vectors in a lattice. The book is intended as an introduction to a diverse collection of techniques.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 236 pp. Englisch.
Edité par Springer US, Springer New York, 2010
ISBN 10 : 1441930000 ISBN 13 : 9781441930002
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 111,35
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is designed for a topics course in computational number theory. It is based around a number of difficult old problems that live at the interface of analysis and number theory. Some of these problems are the following: The Integer Chebyshev Problem. Find a nonzero polynomial of degree n with integer eoeffieients that has smallest possible supremum norm on the unit interval. Littlewood's Problem. 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. Find a polynomial with integer co effieients that is divisible by (z - l)n and has smallest possible 1 norm. (That 1 is, the sum of the absolute values of the eoeffieients is minimal.) Lehmer's Problem. Show that any monie polynomial p, p(O) i- 0, with in teger coefficients that is irreducible and that is not a cyclotomic polynomial has Mahler measure at least 1.1762 . All of the above problems are at least forty years old; all are presumably very hard, certainly none are completely solved; and alllend themselves to extensive computational explorations. The techniques for tackling these problems are various and include proba bilistic methods, combinatorial methods, 'the circle method,' and Diophantine and analytic techniques. Computationally, the main tool is the LLL algorithm for finding small vectors in a lattice. The book is intended as an introduction to a diverse collection of techniques.
Edité par Springer New York, Springer US, 2002
ISBN 10 : 0387954449 ISBN 13 : 9780387954448
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 114,36
Quantité disponible : 1 disponible(s)
Ajouter au panierBuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is designed for a topics course in computational number theory. It is based around a number of difficult old problems that live at the interface of analysis and number theory. Some of these problems are the following: The Integer Chebyshev Problem. Find a nonzero polynomial of degree n with integer eoeffieients that has smallest possible supremum norm on the unit interval. Littlewood's Problem. 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. Find a polynomial with integer co effieients that is divisible by (z - l)n and has smallest possible 1 norm. (That 1 is, the sum of the absolute values of the eoeffieients is minimal.) Lehmer's Problem. Show that any monie polynomial p, p(O) i- 0, with in teger coefficients that is irreducible and that is not a cyclotomic polynomial has Mahler measure at least 1.1762 . All of the above problems are at least forty years old; all are presumably very hard, certainly none are completely solved; and alllend themselves to extensive computational explorations. The techniques for tackling these problems are various and include proba bilistic methods, combinatorial methods, 'the circle method,' and Diophantine and analytic techniques. Computationally, the main tool is the LLL algorithm for finding small vectors in a lattice. The book is intended as an introduction to a diverse collection of techniques.
EUR 79,21
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 174,17
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 164,83
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Like New. Like New. book.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 196,66
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Edité par Springer New York Jul 2002, 2002
ISBN 10 : 0387954449 ISBN 13 : 9780387954448
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 106,99
Quantité disponible : 2 disponible(s)
Ajouter au panierBuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This introduction to computational number theory is centered on a number of problems that live at the interface of analytic, computational and Diophantine number theory, and provides a diverse collection of techniques for solving number- theoretic problems. There are many exercises and open research problems included. 236 pp. Englisch.
Edité par Springer New York Dez 2010, 2010
ISBN 10 : 1441930000 ISBN 13 : 9781441930002
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 106,99
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This introduction to computational number theory is centered on a number of problems that live at the interface of analytic, computational and Diophantine number theory, and provides a diverse collection of techniques for solving number- theoretic problems. There are many exercises and open research problems included. 232 pp. Englisch.
Vendeur : moluna, Greven, Allemagne
EUR 92,27
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This introduction to computational number theory is centered on a number of problems that live at the interface of analytic, computational and Diophantine number theory, and provides a diverse collection of techniques for solving number- theoretic proble.
Vendeur : moluna, Greven, Allemagne
EUR 92,27
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This introduction to computational number theory is centered on a number of problems that live at the interface of analytic, computational and Diophantine number theory, and provides a diverse collection of techniques for solving number- theoretic proble.
Vendeur : preigu, Osnabrück, Allemagne
EUR 95,80
Quantité disponible : 5 disponible(s)
Ajouter au panierBuch. Etat : Neu. Computational Excursions in Analysis and Number Theory | Peter Borwein | Buch | x | Englisch | 2002 | Springer US | EAN 9780387954448 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
Edité par Springer US, Springer New York Dez 2010, 2010
ISBN 10 : 1441930000 ISBN 13 : 9781441930002
Langue: anglais
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 106,99
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book is designed for a topics course in computational number theory. It is based around a number of difficult old problems that live at the interface of analysis and number theory. Some of these problems are the following: The Integer Chebyshev Problem. Find a nonzero polynomial of degree n with integer eoeffieients that has smallest possible supremum norm on the unit interval. Littlewood's Problem. 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. Find a polynomial with integer co effieients that is divisible by (z - l)n and has smallest possible 1 norm. (That 1 is, the sum of the absolute values of the eoeffieients is minimal.) Lehmer's Problem. Show that any monie polynomial p, p(O) i- 0, with in teger coefficients that is irreducible and that is not a cyclotomic polynomial has Mahler measure at least 1.1762 . All of the above problems are at least forty years old; all are presumably very hard, certainly none are completely solved; and alllend themselves to extensive computational explorations. The techniques for tackling these problems are various and include proba bilistic methods, combinatorial methods, 'the circle method,' and Diophantine and analytic techniques. Computationally, the main tool is the LLL algorithm for finding small vectors in a lattice. The book is intended as an introduction to a diverse collection of techniques.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 232 pp. Englisch.