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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
This book is designed for a computationally intensive graduate course based around a collection of classical unsolved extremal problems for polynomials. These problems, all of which lend themselves to extensive computational exploration, live at the interface of analysis, combinatorics and number theory so the techniques involved are diverse. A main computational tool used is the LLL algorithm for finding small vectors in a lattice.
Many exercises and open research problems are included. Indeed one aim of the book is to tempt the able reader into the rich possibilities for research in this area. Peter Borwein is Professor of Mathematics at Simon Fraser University and the Associate Director of the Centre for Experimental and Constructive Mathematics. He is also the recipient of the Mathematical Association of Americas Chauvenet Prize and the Merten M. Hasse Prize for expository writing in mathematics.„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 21,32 für den Versand von Kanada nach Deutschland
Versandziele, Kosten & DauerGratis für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerAnbieter: Attic Books (ABAC, ILAB), London, ON, Kanada
Hardcover. Zustand: 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. Bestandsnummer des Verkäufers 149487
Anzahl: 1 verfügbar
Anbieter: Attic Books (ABAC, ILAB), London, ON, Kanada
Hardcover. Zustand: Near fine. CMS Books in Mathematics. x, 220 p. 24 cm. Ink signature on first leaf. Bestandsnummer des Verkäufers 133660
Anzahl: 1 verfügbar
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Bestandsnummer des Verkäufers 1045453/202
Anzahl: 1 verfügbar
Anbieter: Basi6 International, Irving, TX, USA
Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Bestandsnummer des Verkäufers ABEJUNE24-89393
Anzahl: 1 verfügbar
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: 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. Bestandsnummer des Verkäufers ABNR-83982
Anzahl: 1 verfügbar
Anbieter: ALLBOOKS1, Direk, SA, Australien
Brand new book. Fast ship. Please provide full street address as we are not able to ship toPOboxaddress. Bestandsnummer des Verkäufers SHUB89393
Anzahl: 1 verfügbar
Anbieter: Hourglass Books, Vancouver, BC, Kanada
Hardcover. Zustand: 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. Bestandsnummer des Verkäufers 005245
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: 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. Bestandsnummer des Verkäufers 5912535
Anzahl: Mehr als 20 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9780387954448
Anzahl: 2 verfügbar
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9780387954448
Anzahl: 2 verfügbar