Divisible Fibonacci? Sounds crazy!

The fibonacci sequence is defined as \(F_0=0,F_1=1\) and for \(n\geq 2\), \[F_n=F_{n-1}+F_{n-2}\]

Thus, the fibonacci sequence is \(0,1,1,2,3,5,8,13,...\)

Find the sum of all the numbers less than \(\textbf{1 billion}\) which appear in the \(\textbf{Fibonacci Sequence}\) and are divisible by \(3\).

×

Problem Loading...

Note Loading...

Set Loading...