Time for another solution of the Project Euler. Problem 2 is not that difficult either, but it will require more computing power. Here’s the description: 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, […]

My plan is to post a solution to all the ProjectEuler.net problems I have managed to solve. But don’t worry I won’t spoil your fun throwing out the answer right away. Instead I’ll describe my reasoning and paste my code, so that you can work on your own solution. Problem 1 has the following description: […]