← RoseCode

ROSECODE 411

Standard Nim

Min_25 · Math ·

Let C(n,k) be the number of integer solutions (x1,…,xk) such that ⨁i=1kxi=0 and 0≤xi<n for each i. Here, x⊕y means x xor y.

Let F(n) be the n-th fibonacci number: F(0)=0,F(1)=1, and F(i)=F(i−1)+F(i−2) for i≥2.

Let S(n):=∑i=1n∑j=1nC(F(i),F(j)). You are given S(6)=2153296 and S(7)=18998620089329.

Find S(92) modulo 109+7.

[My timing] 0.3 seconds.