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, […]