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.
Notice That::
Every third term of this series is even.... and the series of even terms goes like 0,2,8,34,... so any even term E(n)can be expressed as E(n)= 4*E(n-1) + E(n-2)....
this small knowledge makes the algorithm quite small and effective.
Project Euler #2: Even Fibonacci numbers
You are viewing a single comment's thread. Return to all comments →
Notice That:: Every third term of this series is even.... and the series of even terms goes like 0,2,8,34,... so any even term E(n)can be expressed as E(n)= 4*E(n-1) + E(n-2)....
this small knowledge makes the algorithm quite small and effective.