The famous mathematical cat Penrose takes us on a trip though puzzleland, while sharing fascinating and challenging puzzles in this uniquely designed mini book. Each page's puzzle is introduced by our star Penrose or one of his quirky friends. Readers are treated to page after page of Penrose antics and problems, while the over 100 mind teasers stimulate and engage its readers gray cells, This book's mini format and fun graphics makes it hard to resist picking up, and its characters and puzzles are sure to entertain both kids or adults.
Penrose is back, and ready to usher young readers along as he encounters more amazing mathematical ideas in a sequence of adventure tales. At once demystifying and challenging, the book...
Penrose, a cat with a knack for math, takes children on an adventurous tour of mathematical concepts from fractals to infinity. When the fractal dragon jumps off the computer screen...
Explores mathematics through stories, puzzles, challenges, games, tricks, and experiments. Answers are provided in a separate section.
A treasure trove of stories that make mathematical ideas come to life. Explores math concepts and topics such as real numbers, exponents, dimensions, the golden rectangle in both serious and...
Let's Play Math: How Families Can Learn Math Together—and Enjoy It
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.
Now Pappas has done it again, or rather, has done more!The pages of MORE JOY OF MATHEMATICS spill over with ideas, puzzles, games from all over the world, historic background,...
Originally published: Boston: Houghton Mifflin, 1987.
In this interactive novel, the reader is invited to play along with the two heroines on their grand math adventure."--back cover.
21-2 . 21. For an accessible account of the notion of algorithmic complexity ' , see Chaitin ( 1975 ) . 22. See Hsu et al . ( 1990 ) . 23. See Freedman ( 1994 ) . 24. See , for example , Moravec ( 1994 ) . 25.