Mathspp Blog

A blog dedicated to mathematics and programming!

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.

How many matches does it take to find the winner of a tennis tournament?

Can you show that perfect compression is impossible?

Can you tile a chessboard with two missing squares?

How many queens and knights can you place on a chessboard?

In how many ways can you place 8 queens on a chessboard?

This is a short article on how I quickly used APL to verify my combinatorics calculations.

Can you help these kids trick or treat their entire neighbourhood in this Halloween special?

If I scramble a Rubik's cube for long enough, will it solve itself?

Three friends are given three different numbers that add up to a dozen. Can you figure out everyone's numbers?

This is an algorithmic puzzle where you just have to turn some coins.

In this article we use (finite state) automatons to count 698,438,863,898,480,640 passwords in a couple milliseconds.

Syncro is a beautiful game where you have to unite all the petals in a single flower. In how many moves can you do it?

A waiter at a restaurant gets a group's order completely wrong. Can you turn the table to get two or more orders right?

A bunch of ants are left inside a very, very, tight tube, and they keep colliding with each other and turning around. How long will it take them to escape?

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?

I bet you have seen one of those Facebook publications where you have a grid and you have to count the number of squares the grid contains, and then you jump to the comment section and virtually no one agrees on what the correct answer should be... Let's settle this once and for all!