It comprises non-technical essays on every aspect of the vast subject, including articles by scores of eminent mathematicians and other thinkers.

    The Times called it elegant, discursive, and littered with quotes and allusions from Aquinas via Gershwin to Woolf and The Philadelphia Inquirer praised it as absolutely scintillating. In this delightful new book, Robert Kaplan, writing together with his wife Ellen Kaplan, once again takes us on a witty, literate, and accessible tour of the world of mathematics. Where The Nothing That Is looked at math through the lens of zero, The Art of the Infinite takes infinity, in its countless guises, as a touchstone for understanding mathematical thinking. Tracing a path from Pythagoras, whose great Theorem led inexorably to a discovery that his followers tried in vain to keep secret (the existence of irrational numbers); through Descartes and Leibniz; to the brilliant, haunted Georg Cantor, who proved that infinity can come in different sizes, the Kaplans show how the attempt to grasp the ungraspable embodies the essence of mathematics. The Kaplans guide us through the Republic of Numbers, where we meet both its upstanding citizens and more shadowy dwellers; and we travel across the plane of geometry into the unlikely realm where parallel lines meet. Along the way, deft character studies of great mathematicians (and equally colorful lesser ones) illustrate the opposed yet intertwined modes of mathematical thinking: the intutionist notion that we discover mathematical truth as it exists, and the formalist belief that math is true because we invent consistent rules for it. Less than All, wrote William Blake, cannot satisfy Man. The Art of the Infinite shows us some of the ways that Man has grappled with All, and reveals mathematics as one of the most exhilarating expressions of the human imagination.

    But a dispute over its discovery sowed the seeds of discontent between two of the greatest scientific giants of all time - Sir Isaac Newton and Gottfried Wilhelm Leibniz." "Today Newton and Leibniz are generally considered the twin independent inventors of calculus. They are both credited with giving mathematics its greatest push forward since the time of the Greeks. Had they known each other under different circumstances, they might have been friends. But in their own lifetimes, the joint glory of calculus was not enough for either and each declared war against the other, openly and in secret." This long and bitter dispute has been swept under the carpet by historians - perhaps because it reveals Newton and Leibniz in their worst light - but The Calculus Wars tells the full story in narrative form for the first time. This history ultimately exposes how these twin mathematical giants were brilliant, proud, at times mad, and in the end completely human.

    If you're a reasonably proficient programmer who can think logically, you have all the background you'll need. Stepanov and Rose introduce the relevant abstract algebra and number theory with exceptional clarity. They carefully explain the problems mathematicians first needed to solve, and then show how these mathematical solutions translate to generic programming and the creation of more effective and elegant code. To demonstrate the crucial role these mathematical principles play in many modern applications, the authors show how to use these results and generalized algorithms to implement a real-world public-key cryptosystem. As you read this book, you'll master the thought processes necessary for effective programming and learn how to generalize narrowly conceived algorithms to widen their usefulness without losing efficiency. You'll also gain deep insight into the value of mathematics to programming--insight that will prove invaluable no matter what programming languages and paradigms you use. You will learn aboutHow to generalize a four thousand-year-old algorithm, demonstrating indispensable lessons about clarity and efficiencyAncient paradoxes, beautiful theorems, and the productive tension between continuous and discreteA simple algorithm for finding greatest common divisor (GCD) and modern abstractions that build on itPowerful mathematical approaches to abstractionHow abstract algebra provides the idea at the heart of generic programmingAxioms, proofs, theories, and models: using mathematical techniques to organize knowledge about your algorithms and data structuresSurprising subtleties of simple programming tasks and what you can learn from themHow practical implementations can exploit theoretical knowledge