Project Euler #2: Even Fibonacci numbers

  • + 1 comment

    The Binet's Formula would be very helpful in case we need to compute only n'th number.

    But to calculate sums we need all even numbers and recursive calculation "E(n) = 4E(n-1) + E(n-2)" of all even numbers would be faster then calculacting them by Binet's Formula.

    • + 0 comments

      Yes That will be a great