Wednesday, December 11, 2013

Interesting combinatorics problem

I saw this problem in an old book on combinatorics I had, it took me a while to solve, but it is easy if you are familiar with the work of Euler.

Prove that an even length palindrome of integers is divisible by 11

If you know the answer - post it in the comments. If not, wait for a post by me :)

Dynamic programming for the binomial coefficient

More fun things, this time with some visualisation of what happens when memoisation is used and what happens when we don't. I don'...