In this first episode, in the series of episodes on the Euler Project, Uncle Bob tackles Euler Problem #1: the sum of the multiples of 3 and 5 below 1000. The problem is pretty simple, but in true MythBuster’s style, Uncle Bob takes the problem to the max through a series of generalizations and then optimizations. It’s a fun romp through programming algorithmic and mathematical theory in Clojure. As always you’ll see Uncle Bob thrash about and fail, but push through to succeed in the end. The result is pretty surprising, and just plain pretty as well.