Reimer takes you on a lively and entertaining tour of the ancient Egyptian world, providing rich historical details and amusing anecdotes as he presents a host of mathematical problems drawn from different eras of the Egyptian past. Each of these problems is like a tantalizing puzzle, often with a beautiful and elegant solution. As you solve them, you’ll be immersed in many facets of Egyptian life, from hieroglyphs and pyramid building to agriculture, religion, and even bread baking and beer brewing.
Fully illustrated in color throughout, Count Like an Egyptian also teaches you some Babylonian computation—the precursor to our modern system—and compares ancient Egyptian mathematics to today’s math, letting you decide for yourself which is better.
From ancient Greek geometry to today's cutting-edge research, Euler's Gem celebrates the discovery of Euler's beloved polyhedron formula and its far-reaching impact on topology, the study of shapes. In 1750, Euler observed that any polyhedron composed of V vertices, E edges, and F faces satisfies the equation V-E+F=2. David Richeson tells how the Greeks missed the formula entirely; how Descartes almost discovered it but fell short; how nineteenth-century mathematicians widened the formula's scope in ways that Euler never envisioned by adapting it for use with doughnut shapes, smooth surfaces, and higher dimensional shapes; and how twentieth-century mathematicians discovered that every shape has its own Euler's formula. Using wonderful examples and numerous illustrations, Richeson presents the formula's many elegant and unexpected applications, such as showing why there is always some windless spot on earth, how to measure the acreage of a tree farm by counting trees, and how many crayons are needed to color any map.
Filled with a who's who of brilliant mathematicians who questioned, refined, and contributed to a remarkable theorem's development, Euler's Gem will fascinate every mathematics enthusiast.
Popular-math writer Paul Nahin challenges readers to solve twenty-one difficult but fun problems, from determining the odds of coin-flipping games to figuring out the behavior of elevators. Problems build from relatively easy (deciding whether a dishwasher who breaks most of the dishes at a restaurant during a given week is clumsy or just the victim of randomness) to the very difficult (tackling branching processes of the kind that had to be solved by Manhattan Project mathematician Stanislaw Ulam). In his characteristic style, Nahin brings the problems to life with interesting and odd historical anecdotes. Readers learn, for example, not just how to determine the optimal stopping point in any selection process but that astronomer Johannes Kepler selected his second wife by interviewing eleven women.
The book shows readers how to write elementary computer codes using any common programming language, and provides solutions and line-by-line walk-throughs of a MATLAB code for each problem.
Digital Dice will appeal to anyone who enjoys popular math or computer science. In a new preface, Nahin wittily addresses some of the responses he received to the first edition.