Self Maths Puzzle Numerical Ability Sequence and Series

Given a Fibonacci function

f1=1;f2=1

fn=f(n-1)+f(n-2) which of the following is t is true?

1. Every Second element is even

2. Every third element is odd

3. The series increases monotonally

4. For n>2, fn=ceiling(1.6 * f(n-1))

5. None

Read Solution (Total 1)

Self Other Question

Q. Find the next term:
375,864,753,648,.......
please give formula for sum of any fibonacci series??