Math to the rescue again!
To compute the n-th Fibonacci number, you can use the Binet formula:

where φ is the Golden Ratio, (1 + √5)/2. Also, it's given that f(0) = 0 and f(1) = 1, instead of having 1 and 2 as the first two Fibonacci's numbers.

In order to know which Fibonacci number is the highest below 4 million, we can solve by n... which isn't really easy. So, instead, we get to obtain a (pretty good) estimate by ignoring the second term (-1/φ)^{n,} which quickly approaches to 0, and solve:

In fact, f(33) = 3524578 and f(34) = 5702887.
Now, it's time to sum. First of all, let's notice that the even terms in the Fibonacci sequence happen once every three: f(0) = 0, f(3) = 2, f(6) = 8, f(9) = 34 and so on. So, we just have to sum every f(3 k) for k from 0 to 11. Using the known formula:

and using a = φ, h = 3 and n = 11, we have:

So, more in general, using JavaScript (for example):

constSQ5=5**.5;constPHI=(1+SQ5)/2;functionallEvenFibonacciUpTo(limit){consthighestIndexBelowLimit=Math.floor(Math.log(limit*SQ5)/Math.log(PHI));// I love expressive variable names, but the formula could get too long!constn=Math.floor(highestIndexBelowLimit/3);return((PHI**(3*n+3)-1)/(PHI**3-1)-((1-PHI)**(3*n+3)-1)/((1-PHI)**3-1))/SQ5;}console.log(allEvenFibonacciUpTo(4e6));// 4613731.999999999

Well... I guess we'll have to deal with some rounding problems 😅
But another O(1) solution, yay! 🎉

These are really great solutions. I think it would be worthwhile for you to publish them as standalone articles. One quibble: I don't think this is O(1) since arithmetic operations are not constant time as a function of input, although I guess as long as we’re sticking with floating point numbers O(1) is probably valid.

You're correct that addition is O(log N) for a number N, or O(log n) where n is the number of digits. The power function x^n also has a O(log N) time complexity if N is an integer (I presume it's also linear on number of significant bits).

Given fixed sized types on a computer though I believe most of these become constant time, as the inputs have a fixed upper limit on bits. It probably involves an unrolled loop, or fixed iterations on a CPU.

Yes, indeed. I am in fact using just plain double precision numbers there, and they do take a fixed amount of ticks for common operations like those on a modern CPU.

I wouldn't be so certain if I used JavaScript's BigInt numbers (or rather, I would be certain of the opposite).

Ah nice to see maths, I came up with the same thing however with a different approach of using generator functions.

Let us forget about fibonacci and think of the even fibonacci as a new series. (I probably think there would be a mathematical way of deducing it, but I just used brute force to find it out)

So the recurrence relation for this series would be

F_{n}= 4F_{n-1} + F_{n-2}.
To find out the Sum of n elements in this series (let's call this S_{n}), we can rewrite the recurrence relation like this: 4F_{n-1} = F_{n} - F_{n-2}
and we can move all n's by 1: 4F_{n} = F_{n+1} - F_{n-1}

Now we can use the same logic to finder other n's: 4F_{n} = F_{n+1} - F_{n-1} 4F_{n-1} = F_{n} - F_{n-2} 4F_{n-2} = F_{n-1} - F_{n-3} 4F_{n-3} = F_{n-2} - F_{n-3} ... ... 4F_{4} = F_{5} - F_{3} 4F_{3} = F_{4} - F_{2} 4F_{2} = F_{3} - F_{1} 4F_{1} = 4F_{1}

For folks not familiar with this technique, we are simply doing to cancel out similar terms when we add all equations. (Note all items in pair are canceled out since x - x = 0).

If you notice the left hand side is essentially equivalent to 4S_{n}

Now we can finally write the relation between sum and series as:

S_{n}= ( F_{n+1} + F_{n} - F_{2} + 3F_{1} ) / 4

The point is this avoids the for loop for summing all the values. Go ahead and try substituting values and you will find this sums it up. You will have to use F(1) = 2 and F(2) = 8.

Now that we have removed one for loop, how do we get a direct formula for getting the F_{n}.

This involves a bit more complicated math(for adventurous folks visit austinrochford.com/posts/2013-11-0...).
In short the closed form for this recurrence relation is
And if you compute the roots and follow along the url I posted above, you will end up with this

This gives us a function to compute F_{n} .

Now we can combine our summing and this formula to get a simple O(1) arithmetic function to get the sum. Side note: Running a for loop will take much less brain time :P

## re: Project Euler #2 - Even Fibonacci numbers VIEW POST

VIEW FULL DISCUSSIONMath to the rescue again!

To compute the

n-th Fibonacci number, you can use the Binet formula:where

φis the Golden Ratio, (1 + √5)/2. Also, it's given thatf(0) = 0 andf(1) = 1, instead of having 1 and 2 as the first two Fibonacci's numbers.In order to know which Fibonacci number is the highest below 4 million, we can solve by

n... which isn't really easy. So, instead, we get to obtain a (pretty good) estimate by ignoring the second term (-1/φ)^{n,}which quickly approaches to 0, and solve:In fact,

f(33) = 3524578 andf(34) = 5702887.Now, it's time to sum. First of all, let's notice that the even terms in the Fibonacci sequence happen once every three:

f(0) = 0,f(3) = 2,f(6) = 8,f(9) = 34 and so on. So, we just have to sum everyf(3k) forkfrom 0 to 11. Using the known formula:and using

a=φ,h= 3 andn= 11, we have:So, more in general, using JavaScript (for example):

Well... I guess we'll have to deal with some rounding problems 😅

But another O(1) solution, yay! 🎉

(By the way, -1/

φ= 1 -φif you were confused.)These are really great solutions. I think it would be worthwhile for you to publish them as standalone articles. One quibble: I don't think this is O(1) since arithmetic operations are not constant time as a function of input, although I guess as long as we’re sticking with floating point numbers O(1) is probably valid.

You're correct that addition is

`O(log N)`

for a number N, or`O(log n)`

where n is the number of digits. The power function`x^n`

also has a`O(log N)`

time complexity if`N`

is an integer (I presume it's also linear on number of significant bits).Given fixed sized types on a computer though I believe most of these become constant time, as the inputs have a fixed upper limit on bits. It probably involves an unrolled loop, or fixed iterations on a CPU.

Yes, indeed. I am in fact using just plain double precision numbers there, and they do take a fixed amount of ticks for common operations like those on a modern CPU.

I wouldn't be so certain if I used JavaScript's BigInt numbers (or rather, I would be certain of the opposite).

Thank you for the explanation!

Ah nice to see maths, I came up with the same thing however with a different approach of using generator functions.

Let us forget about fibonacci and think of the even fibonacci as a new series. (I probably think there would be a mathematical way of deducing it, but I just used brute force to find it out)

So the recurrence relation for this series would be

F._{n}= 4F_{n-1}+ F_{n-2}To find out the Sum of n elements in this series (let's call this S

_{n}), we can rewrite the recurrence relation like this:4F_{n-1}= F_{n}- F_{n-2}and we can move all n's by 1:

4F_{n}= F_{n+1}- F_{n-1}Now we can use the same logic to finder other n's:

4F_{n}= F_{n+1}- F_{n-1}4F_{n-1}= F_{n}- F_{n-2}4F_{n-2}= F_{n-1}- F_{n-3}4F_{n-3}= F_{n-2}- F_{n-3}......4F_{4}= F_{5}- F_{3}4F_{3}= F_{4}- F_{2}4F_{2}= F_{3}- F_{1}4F_{1}= 4F_{1}For folks not familiar with this technique, we are simply doing to cancel out similar terms when we add all equations. (Note all items in pair are canceled out since

`x - x = 0`

).4F_{n}= F_{n+1}-~~F~~_{n-1}4F_{n-1}= F_{n}-~~F~~_{n-2}4F_{n-2}=~~F~~-_{n-1}~~F~~_{n-3}4F_{n-3}=~~F~~-_{n-2}~~F~~_{n-3}......4F_{4}=~~F~~-_{5}~~F~~_{3}4F_{3}=~~F~~- F_{4}_{2}4F_{2}=~~F~~- F_{3}_{1}4F_{1}= 4F_{1}4F

_{n}+ 4F_{n-1}+ 4F_{n-2}+ ... + 4F_{2}+ 4F_{1}= F_{n+1}+ F_{n}- F_{2}+ 3F_{1}If you notice the left hand side is essentially equivalent to

4S_{n}Now we can finally write the relation between sum and series as:

The point is this avoids the for loop for summing all the values. Go ahead and try substituting values and you will find this sums it up. You will have to use

`F(1) = 2`

and`F(2) = 8`

.Now that we have removed one

`for loop`

, how do we get a direct formula for getting the F_{n}.This involves a bit more complicated math(for adventurous folks visit austinrochford.com/posts/2013-11-0...).

In short the closed form for this recurrence relation is

And if you compute the roots and follow along the url I posted above, you will end up with this

This gives us a function to compute F

_{n}.Now we can combine our summing and this formula to get a simple O(1) arithmetic function to get the sum. Side note: Running a for loop will take much less brain time :P

I applaud your solution, fellow math lover! 👏