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.

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.

Famed puzzle expert explains math behind a multitude of mystifying tricks: card tricks, stage "mind reading," coin and match tricks, counting out games, geometric dissections, etc. More than 400 tricks. 135 illustrations.

Playing with mathematical riddles can be an intriguing and fun-filled pastime — as popular science writer Martin Gardner proves in this entertaining collection. Puzzlists need only an elementary knowledge of math and a will to resist looking up the answer before trying to solve a problem. Written in a light and witty style, Entertaining Mathematical Puzzles is a mixture of old and new riddles, grouped into sections that cover a variety of mathematical topics: money, speed, plane and solid geometry, probability, topology, tricky puzzles, and more. The probability section, for example, points out that everything we do, everything that happens around us, obeys the laws of probability; geometry puzzles test our ability to think pictorially and often, in more than one dimension; while topology, among the "youngest and rowdiest branches of modern geometry," offers a glimpse into a strange dimension where properties remain unchanged, no matter how a figure is twisted, stretched, or compressed. Clear and concise comments at the beginning of each section explain the nature and importance of the math needed to solve each puzzle. A carefully explained solution follows each problem. In many cases, all that is needed to solve a puzzle is the ability to think logically and clearly, to be "on the alert for surprising, off-beat angles...that strange hidden factor that everyone else had overlooked." Fully illustrated, this engaging collection will appeal to parents and children, amateur mathematicians, scientists, and students alike, and may, as the author writes, make the reader "want to study the subject in earnest" and explains "some of the inviting paths that wind away from the problems into lusher areas of the mathematical jungle." 65 black-and-white illustrations.

Combines two previously published works, resulting in ninety-three brain-teasing puzzles, riddles, and questions with an emphasis on humor.

School maths is not the interesting part. The real fun is elsewhere. Like a magpie, Ian Stewart has collected the most enlightening, entertaining and vexing 'curiosities' of maths over the years... Now, the private collection is displayed in his cabinet. There are some hidden gems of logic, geometry and probability -- like how to extract a cherry from a cocktail glass (harder than you think), a pop up dodecahedron, the real reason why you can't divide anything by zero and some tips for making money by proving the obvious. Scattered among these are keys to unlocking the mysteries of Fermat's last theorem, the Poincar Conjecture, chaos theory, and the P/NP problem for which a million dollar prize is on offer. There are beguiling secrets about familiar names like Pythagoras or prime numbers, as well as anecdotes about great mathematicians. Pull out the drawers of the Professor's cabinet and who knows what could happen...

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.