## November 25, 2014

# Project Euler p. 2

The next one was a bit trickier to figure out, due to my inexperience with looping constructs in Clojure. The actual Fibonacci is quite simple, the problem description contain all the information you need:
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, …
Read more