Divisible Fibonacci? Sounds crazy!

The fibonacci sequence is defined as F0=0,F1=1F_0=0,F_1=1 and for n2n\geq 2, Fn=Fn1+Fn2F_n=F_{n-1}+F_{n-2}

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

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

×

Problem Loading...

Note Loading...

Set Loading...