Processing math: 100%

Problem #149

Fibonacci Sum

Define: F(0)=0

F(1)=1

F(n)=F(n-1) + F(n-2) , n>=2

Define S(N,K) = \sum_{n=0}^{N} F(1+n*K) mod 1000000009

Given S(10^{12},100) = 878943097

Enter the value of S(221^{221^{10^{18}}},55^{55^{10^{18}}})

Contributed by Adarsh Kumar

Solved by 15 users

Log in to submit answers.

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.