eBook downloads, eBook resources & eBook authors
No amateur or math authority can be without this ultimate compendium of classic puzzles, paradoxes, and puzzles from America's best-loved mathematical expert. 320 line drawings.
The renowned provocateur of popular math presents a collection of his widely recognized short puzzles--along with a few new ones--that explore chess, physics, probability, and topology, among other topics.
Martin Gardner's Mathematical Games columns in Scientific American inspired and entertained several generations of mathematicians and scientists. Gardner in his crystal-clear prose illuminated corners of mathematics, especially recreational mathematics, that most people had no idea existed. His playful spirit and inquisitive nature invite the reader into an exploration of beautiful mathematical ideas along with him. These columns were both a revelation and a gift when he wrote them; no one--before Gardner--had written about mathematics like this. They continue to be a marvel. This volume, originally published in 1959, contains the first sixteen columns published in the magazine from 1956-1958. They were reviewed and briefly updated by Gardner for this 1988 edition.
The noted expert selects 70 of his favorite "short" puzzles, including such mind-bogglers as The Returning Explorer, The Mutilated Chessboard, Scrambled Box Tops, and dozens more involving logic and basic math. Solutions included.
The Whys of a Philosophical Scrivener showcases Martin Gardner as the consummate philosopher, thinker, and great mathematician that he is. Exploring issues that range from faith to prayer to evil to immortality, and far beyond, Garnder challenges the discerning reader with fundamental questions of classical philosophy and life's greater meanings. Recalling such philosophers was Wittgenstein and Arendt, The Whys of Philosophical Scrivener embodies Martin Garner's unceasing interest and joy in the impenetrable mysteries of life.
Martin Gardner's Mathematical Games columns in Scientific American inspired and entertained several generations of mathematicians and scientists. Gardner in his crystal-clear prose illuminated corners of mathematics, especially recreational mathematics, that most people had no idea existed. His playful spirit and inquisitive nature invite the reader into an exploration of beautiful mathematical ideas along with him. These columns were both a revelation and a gift when he wrote them; no one--before Gardner--had written about mathematics like this. They continue to be a marvel. This volume, first published in 1975, contains columns published in the magazine from 1965-1967. This 1989 MAA edition contains a foreword by John H. Conway and a postscript and extended bibliography added by Gardner for this edition.
Combines two previously published works, resulting in ninety-three brain-teasing puzzles, riddles, and questions with an emphasis on humor.
This compilation of long-inaccessible puzzles by a famous puzzle master offers challenges ranging from arithmetical and algebraical problems to those involving geometry, combinatorics, and topology, plus game, domino, and match puzzles. Includes answers.
Algorithmic puzzles are puzzles involving well-defined procedures for solving problems. This book will provide an enjoyable and accessible introduction to algorithmic puzzles that will develop the reader's algorithmic thinking. The first part of this book is a tutorial on algorithm design strategies and analysis techniques. Algorithm design strategies — exhaustive search, backtracking, divide-and-conquer and a few others — are general approaches to designing step-by-step instructions for solving problems. Analysis techniques are methods for investigating such procedures to answer questions about the ultimate result of the procedure or how many steps are executed before the procedure stops. The discussion is an elementary level, with puzzle examples, and requires neither programming nor mathematics beyond a secondary school level. Thus, the tutorial provides a gentle and entertaining introduction to main ideas in high-level algorithmic problem solving. The second and main part of the book contains 150 puzzles, from centuries-old classics to newcomers often asked during job interviews at computing, engineering, and financial companies. The puzzles are divided into three groups by their difficulty levels. The first fifty puzzles in the Easier Puzzles section require only middle school mathematics. The sixty puzzle of average difficulty and forty harder puzzles require just high school mathematics plus a few topics such as binary numbers and simple recurrences, which are reviewed in the tutorial. All the puzzles are provided with hints, detailed solutions, and brief comments. The comments deal with the puzzle origins and design or analysis techniques used in the solution. The book should be of interest to puzzle lovers, students and teachers of algorithm courses, and persons expecting to be given puzzles during job interviews.
