Fibonazi

Problem #220

We define,

$f(i)$ = $f(i-1)$ + $f(i-2)$ and,

$F(i)$ = $(i^2)$ $f(i)$

Find $(\sum_{i = 1}^N F(i))$ mod $(10^9+7)$

$N = 10^{18} , f(1)=1, f(2)=1$

Hint - https://www.geeksforgeeks.org/matrix-exponentiation/

Contributed by Samarth Joshi

Solved by 17 users

Log in to submit answers.

View All Submissions

Is something wrong?

Maintaining a collection of high quality questions is our top priority. If, however, you do find an error, report the problem and we'll make sure it is reviewed soon.