From the reviews of the first edition:
"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."
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)