Andere Kunden interessierten sich auch für
![Value Distribution Theory Related to Number Theory]( "Value Distribution Theory Related to Number Theory")
Value Distribution Theory Related to Number Theory53,49 €![Public-Key Cryptography and Computational Number Theory]( "Public-Key Cryptography and Computational Number Theory")
Public-Key Cryptography and Computational Number Theory126,99 €![Handbook of Number Theory II]( "Handbook of Number Theory II")
Handbook of Number Theory II164,99 €![Number Theory]( "Number Theory")
Number Theory77,99 €![Fundamentals of Set and Number Theory]( "Fundamentals of Set and Number Theory")
Fundamentals of Set and Number Theory164,95 €![Basic Number Theory]( "Basic Number Theory")
Basic Number Theory54,99 €![An Introduction to Number Theory]( "An Introduction to Number Theory")
An Introduction to Number Theory56,99 €
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.
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.
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.
From the reviews of the first edition: MAA ONLINE "Explanations are thorough but not easy to understand. Nevertheless, they can be understood by the determined graduate student in mathematics. However, the ideal mix would be a collection of mathematics and computer science students, as the level of computer expertise needed to code the solutions to the problems is at the upper division level...Research mathematicians often need to be able to write code to attack specific problems when no appropriate software tool is available. This book is ideal for a course designed to teach graduate students how to do that as long as they have or can obtain the necessary programming knowledge." P. Borwein Computational Excursions in Analysis and Number Theory "Borwein has collected known results in the direction of several related, appealing, old, open problems (Integer Chebyshev, Prouhet-Tarry-Escott, Erdos-Szekeres, Littlewood). Far from narrow, this interdisciplinary book draws on Diophantine, analytic, and probabilistic techniques. Also, by dint of the celebrated lattice reduction algorithm, some aspects of these problems admit attack by computer; a handful of intriguing computer graphics offer visceral evidence of the intrinsic complexity of the underlying phenomena. Pisot and Salam numbers make terrific enrichment material for undergraduates. As in all Borwein's books, we get beautiful mathematics gracefully explained."-CHOICE "This extraordinary book brings together a variety of old problems - old, but very much alive - about polynomials with integer co-efficients. ... The necessary background is also presented, which makes the book self-contained ... . this book is suitable for advanced students of analysis and analytic number theory. It is very well written, rather concise and to the point. ... Strongly recommended for specialists in computational analysis and number theory." (R. Stroeker, Nieuw Archief voor Wiskunde, Vol. 7 (3), 2006)