Imagine a game of dice: if the biggest number rolled is one, two, three, or four, player 1 wins. If the biggest number rolled is five or six, player 2 wins. Who has the best probability of winning the game? Leonardo Barichello explains how probability holds the answer to this seemingly counterintuitive puzzle.
An algorithm is a method of solving problems both big and small. Though computers run algorithms constantly, humans can also solve problems with algorithms. David J. Malan explains how algorithms can be used in seemingly simple situations and also complex ones.
By our third year, most of us will have learned to count. Once we know how, it seems as if there would be nothing to stop us counting forever. But, while infinity might seem like an perfectly innocent idea, keep counting and you enter a paradoxical world where nothing is as it seems.
Without us noticing, modern life has been taken over. Algorithms run everything from search engines on the internet to satnavs and credit card data security - they even help us travel the world, find love and save lives. Professor Marcus du Sautoy demystifies the hidden world of algorithms. By showing us some of the algorithms most essential to our lives, he reveals where these 2,000-year-old problem solvers came from, how they work, what they have achieved and how they are now so advanced they can even programme themselves.
2015 • Math
One deck. Fifty-two cards. How many arrangements? Let's put it this way: Any time you pick up a well shuffled deck, you are almost certainly holding an arrangement of cards that has never before existed and might not exist again. Yannay Khaikin explains how factorials allow us to pinpoint the exact (very large) number of permutations in a standard deck of cards.
Would mathematics exist if people didn't? Did we create mathematical concepts to help us understand the world around us, or is math the native language of the universe itself? Jeff Dekofsky traces some famous arguments in this ancient and hotly debated question.