Skip to main content
  • Hoopla logo
    Powered by Hoopla
  • Browse
  • My Hoopla
  • Log In
Books, videos, and music - all free from your public library!
LoginSign Up

Footer

Hoopla logo, Go to homepage
  • For Patrons
  • For Libraries (opens in new window)
  • For Vendors (opens in new window)
  • Facebook (opens in new window)
  • X (opens in new window)
  • Instagram (opens in new window)
  • YouTube (opens in new window)
  • TikTok (opens in new window)
  • LinkedIn (opens in new window)

Our Company

  • Our Story
  • Get Hoopla for your Library (opens in new window)
  • Get your content on hoopla (opens in new window)
  • Join our team (opens in new window)
  • Accessibility Statement

Our Content

  • Audiobooks
  • Ebooks
  • Movies
  • Television
  • Comics
  • BingePasses
  • Music
  • The Loop Blog

Help

  • Help Center
  • Submit Feedback
  • Facebook (opens in new window)
  • X (opens in new window)
  • Instagram (opens in new window)
  • YouTube (opens in new window)
  • TikTok (opens in new window)
  • LinkedIn (opens in new window)
  • Download on the App Store (opens in new window)
  • Get it on Google Play (opens in new window)
  • Available at Amazon Appstore (opens in new window)
© 2026 Midwest Tape, LLC. All rights reserved. Privacy Policy | Terms of Use
  1. Navigate Home
  2. Ebooks
  3. Challenging Math Problems

EBOOK

Challenging Math Problems

Terry Stickels
3
(2)
sign up
Pages
112
Year
2015
Language
English
Publisher
Dover Publications

About

Two friends wish to meet for breakfast twice a month throughout the year. In how many ways can they choose those two days so that they never meet on consecutive days? You want to measure 30 seconds and you have two pieces of string, each of which burns for 40 seconds. How can you accomplish this without bending, folding, or cutting the strings? A positive whole number is divisible by 3 and also by 5. When the number is divided by 7, the remainder is 5. What is the smallest number that could work? These are but a few of this book's assembly of the most challenging puzzles imaginable ― and they require no background in higher math, just good thinking skills. Terry Stickels, a well-known puzzle-maker, has compiled 101 of some of the best and most entertaining problems ever published. All of the challenges, which range from probability puzzles to dice games, have two things in common: each offers the "Aha!" moment of discovery that puzzle-solvers love, and they're all fun. Complete solutions for all puzzles explain every detail.

Related Subjects

  • Study & Teaching
  • Mathematics
  • Adult Nonfiction

Artists

Terry StickelsAuthor