Add to wishlist
’Be warned: cracking puzzles releases a very addictive drug.’ – Marcus du Sautoy
Have you ever wanted to be a puzzle pro or logical luminary? Well, look no further!
The perfect way to liven up your day, The Ultimate Mathematical Challenge has over 365 puzzles to test your wits and excite your mind. From starter puzzles to perplexing Olympiad problems designed to stretch even the strongest mathematicians, this book is the ideal forum to get your brain into gear and feed it with the challenges it craves.
Specially curated from the UK Mathematics Trust’s catalogue of puzzles, most of these problems can be tackled using no more than a little numerical knowledge, logical thinking and native wit. Including interludes of crossnumber conundrums and shuttle challenges, space for your working out and a handy glossary for those obscure mathematical terms, this book has everything you need to solve captivating problems all year round.
Do you have what it takes to conquer The Ultimate Mathematical Challenge?
Description
’Be warned: cracking puzzles releases a very addictive drug.’ – Marcus du Sautoy
Have you ever wanted to be a puzzle pro or logical luminary? Well, look no further!
The perfect way to liven up your day, The Ultimate Mathematical Challenge has over 365 puzzles to test your wits and excite your mind. From starter puzzles to perplexing Olympiad problems designed to stretch even the strongest mathematicians, this book is the ideal forum to get your brain into gear and feed it with the challenges it craves.
Specially curated from the UK Mathematics Trust’s catalogue of puzzles, most of these problems can be tackled using no more than a little numerical knowledge, logical thinking and native wit. Including interludes of crossnumber conundrums and shuttle challenges, space for your working out and a handy glossary for those obscure mathematical terms, this book has everything you need to solve captivating problems all year round.
Do you have what it takes to conquer The Ultimate Mathematical Challenge?
