This blog has a really interesting assortment of articles on mathematics and programming. You can use the tags to your right to find topics that interest you, or you may want to have a look at
You can also subscribe to the blog newsletter.
This problem is a step up from Problem #028 - hidden key. Can you tackle this one?
There is a key hidden in one of three boxes and each box has a coin on top of it. Can you use the coins to let your friend know where the key is hiding?
Some people are standing quiet in a line, each person with a hat that has one of two colours. How many people can guess their colour correctly?
Let's prove that, if a set has size \(n\), then that same set has exactly \(2^n\) subsets.
This post's problem is a really interesting problem I solved two times. The first time I solved it I failed to prove exactly how it works... then some years later I remembered the problem statement and was able to solve it properly. Let's see how you do!