Number-Crunching: Taming Unruly Computational Problems from Mathematical Physics to Science Fiction (Hardcover) (ISBN-13: 9780691144252)

More stimulating mathematics puzzles from bestselling author Paul Nahin

How do technicians repair broken communications cables at the bottom of the ocean without actually seeing them? What's the likelihood of plucking a needle out of a haystack the size of the Earth? And is it possible to use computers to create a universal library of everything ever written or every photo ever taken? These are just some of the intriguing questions that best-selling popular math writer Paul Nahin tackles in Number-Crunching. Through brilliant math ideas and entertaining stories, Nahin demonstrates how odd and unusual math problems can be solved by bringing together basic physics ideas and today's powerful computers. Some of the outcomes discussed are so counterintuitive they will leave readers astonished.

Nahin looks at how the art of number-crunching has changed since the advent of computers, and how high-speed technology helps to solve fascinating conundrums such as the three-body, Monte Carlo, leapfrog, and gambler's ruin problems. Along the way, Nahin traverses topics that include algebra, trigonometry, geometry, calculus, number theory, differential equations, Fourier series, electronics, and computers in science fiction. He gives historical background for the problems presented, offers many examples and numerous challenges, supplies MATLAB codes for all the theories discussed, and includes detailed and complete solutions.

Exploring the intimate relationship between mathematics, physics, and the tremendous power of modern computers, Number-Crunching will appeal to anyone interested in understanding how these three important fields join forces to solve today's thorniest puzzles.

Author: Paul Nahin
ISBN-10: 0691144257
ISBN-13: 9780691144252
Publisher: Princeton University Press
Language: English
Published: 08/28/2011
Pages: 408
Format: Hardcover
Weight: 1.59lbs
Size: 9.47h x 6.38w x 1.16d

Review Citation(s):
Choice 01/01/2012