We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
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.
Project Euler #2: Even Fibonacci numbers
You are viewing a single comment's thread. Return to all comments →
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.
Yes That will be a great