I solved the fifth problem from Euler project in Clojure. My first approach was not successful: Even though it could compute the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder, it didn't work for 1 to 20. It consumed to much memory. So I used pen and paper to devise a better approach to solve the problem. I saw that the numbers from 1 to 10 which multiplied produce 2520 are 9, 8, 7 and 5. What these numbers have in common is that they all have one p...