Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Classic Mathemagic Hardcover – September 1, 2003
by
Raymond Blum
(Author),
Adam Hart-Davis
(Author),
Bob Longe
(Author),
Derrick Niederman
(Author)
&
1
more
{"desktop_buybox_group_1":[{"displayPrice":"$8.52","priceAmount":8.52,"currencySymbol":"$","integerValue":"8","decimalSeparator":".","fractionalValue":"52","symbolPosition":"left","hasSpace":false,"showFractionalPartIfEmpty":true,"offerListingId":"EOYb7PvTOIvSbTZYVoh1Ka7nEBuIcANTBQcsYtjNys%2B6HMvMnZifZgg18MGhh5DOKa2sOqehxPZ52hZV5X7dV%2BsShE3hx9DGj8s%2FBWkCUGFC8K42ayaXg1FNK1XKmDPL69zl0eccngHJb6pfMjDUcc3%2FfNBfZzxVTVXmRSPvH9AsH8cbwLWqTCeJew9lFit%2F","locale":"en-US","buyingOptionType":"NEW","aapiBuyingOptionIndex":0}]}
Purchase options and add-ons
Presents a collection of various kinds of math puzzles--including number tricks, memory tricks, and geometric designs--in different levels of difficulty; also includes explanations of mathematical principles.
- Print length280 pages
- LanguageEnglish
- PublisherSterling Pub Co Inc
- Publication dateSeptember 1, 2003
- Dimensions5.5 x 0.75 x 6.75 inches
- ISBN-101402710690
- ISBN-13978-1402710698
Books with Buzz
Discover the latest buzz-worthy books, from mysteries and romance to humor and nonfiction. Explore more
Product details
- Publisher : Sterling Pub Co Inc (September 1, 2003)
- Language : English
- Hardcover : 280 pages
- ISBN-10 : 1402710690
- ISBN-13 : 978-1402710698
- Item Weight : 1.1 pounds
- Dimensions : 5.5 x 0.75 x 6.75 inches
- Best Sellers Rank: #1,079,050 in Books (See Top 100 in Books)
- #19,306 in Puzzles & Games
- Customer Reviews:
Customer reviews
4.1 out of 5 stars
4.1 out of 5
We don’t use a simple average to calculate the overall star rating and percentage breakdown by star. Our system gives more weight to certain factors—including how recent the review is and if the reviewer bought it on Amazon. Learn more
9 global ratings
Zero tolerance for fake reviews
Our goal is to make sure every review is trustworthy and useful. That's why we use both technology and human investigators to block fake reviews before customers ever see them. Learn more
We block Amazon accounts that violate our community guidelines. We also block sellers who buy reviews and take legal actions against parties who provide these reviews. Learn how to report
-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
Reviewed in the United States on April 21, 2016
Great book.
Reviewed in the United States on September 8, 2012
I'm a magician and I bought this as a source of ideas for tricks. It has lots of puzzles (not adaptable for most audiences) and some very nice tricks that have no presentation ideas. It's useful to me, but would lead a young, or literal minded, magician into some very mechanical performances.
Reviewed in the United States on November 29, 2006
My nephews have this book on their shelf. Being a math graduate student, I flipped it open to see what's inside. It looks interesting, and certainly has some cool stuff.
However only after 5 minutes, I ran across this (keep in mind composite numbers are numbers which are NOT prime):
"Are there ever 1,000,000 consecutive composite numbers?"
I know it's true by an abstract algebra theorem. I was curious how they would explain it to a young adult reader. This was how:
"The answer is an emphatic yes. THe 1,000,000-term sequence 1,000,001+2, 1,000,001+3 all the way up to 1,000,001+1,000,001 consists entirely of composite numbers, becuse 1,000,001+K is always evenly divisble by K for any K in this range."
Firstly, I'm pretty sure you can check online to see there are lots of primes between 1,000,000 and 2,000,000. In the second place, their assertion about divisbility is ridiculous. According to that statement, 1,000,001+2=1,000,003 is divisible by 2.
I honestly don't know how many spots there are in the book that are this way. Maybe I just got lucky finding this one question.
However only after 5 minutes, I ran across this (keep in mind composite numbers are numbers which are NOT prime):
"Are there ever 1,000,000 consecutive composite numbers?"
I know it's true by an abstract algebra theorem. I was curious how they would explain it to a young adult reader. This was how:
"The answer is an emphatic yes. THe 1,000,000-term sequence 1,000,001+2, 1,000,001+3 all the way up to 1,000,001+1,000,001 consists entirely of composite numbers, becuse 1,000,001+K is always evenly divisble by K for any K in this range."
Firstly, I'm pretty sure you can check online to see there are lots of primes between 1,000,000 and 2,000,000. In the second place, their assertion about divisbility is ridiculous. According to that statement, 1,000,001+2=1,000,003 is divisible by 2.
I honestly don't know how many spots there are in the book that are this way. Maybe I just got lucky finding this one question.