Definition :A linear recurrence relation is a function or a sequence such that each term is a linear combination of previous terms. Each term can be described as a function of the previous terms.A famous example is the Fibonacci sequence:f(i) = f(i-1) + f(i-2)Linear means that the previous terms in the definition are only multiplied by a constant (possibly zero) and nothing else. So, this sequencef(i) = f(i-1) * f(i-2)is not a linear recurrence.ProblemGiven a functionf(x)defined as a linear recurrence relation. Computef(N),whereNis a large number .SolutionThe solution is broken down into 4 steps :DetermineK, the number of terms on whichf(i)dependsKis the minimum integer such thatf(i)doesn’t depend onf(i-M), for allM > K.For Fibonacci sequence, because the relation istherefore,K = 2.Determine vector F1, the initial valuesIf each term of a recurrence relation depends onKprevious terms, then it must have the firstKterms defined, otherwise the whole sequence is undefined. For Fibonacci sequence (K = 2), the well-known initial values are:f(1)=1 , f(2)=1We define a column vectorFias aK x 1matrix whose first row isf(i), second row isf(i+1), and so on, until Kthrow isf(i+K-1). The initial values offare given in column vectorF1that has valuesf(1)throughf(K):Determine T, the transformation matrixThis is the most important step in solving recurrence relation. The heart of this method is to construct aK x KmatrixT, called transformation matrix, such thatHere is how to construct it. Suppose that.You can solve this equation with any method, and obtain the result:More precisely,Tis aK x Kmatrix whose last row is a vector, and for the other rows, the ithrow is a zero vector except that its (i+1)thelement is 1.Let’s apply it to our example. In Fibonacci sequence,Determine FNAfter we construct the transformation matrix, the rest is very simple. We can obtain Fifor anyi, by repeatedly multiplyingTwith F1. For example, to obtain F2,To obtain F3,And so on. In general,Therefore, the original problem is now (almost) solved: compute FNas above, and then we can obtain f(N): it is exactly the first row of FN. In case of our Fibonacci sequence, the Nthterm in Fibonacci sequence is the first row of:What remains is how to compute TN-1efficiently. The most popular method is to use exponentiation by squaring method that works in O(log N) time, with this recurrence:Multiplying two matrices takes O(K3) time using standard method, so the overall time complexity to solve a linear recurrence is O(K3log N).Here is a sample C++ code to compute the N-th term of Fibonacci sequence, modulo 1,000,000,007.#include<iostream>

#include<vector>

#define REP(i,n) for (int i = 1; i <= n; i++)

using namespace std;

typedef long long ll;

typedef vector<vector<ll> > matrix;

const ll MOD = 1000000007;

const int K = 2;

// computes A * B

matrix mul(matrix A, matrix B)

{

matrix C(K+1, vector<ll>(K+1));

REP(i, K) REP(j, K) REP(k, K)

C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD;

return C;

}

// computes A ^ p

matrix pow(matrix A, int p)

{

if (p == 1)

return A;

if (p % 2)

return mul(A, pow(A, p-1));

matrix X = pow(A, p/2);

return mul(X, X);

}

// returns the N-th term of Fibonacci sequence

int fib(int N)

{

// create vector F1

vector<ll> F1(K+1);

F1[1] = 1;

F1[2] = 1;

// create matrix T

matrix T(K+1, vector<ll>(K+1));

T[1][1] = 0, T[1][2] = 1;

T[2][1] = 1, T[2][2] = 1;

// raise T to the (N-1)th power

if (N == 1)

return 1;

T = pow(T, N-1);

// the answer is the first row of T . F1

ll res = 0;

REP(i, K)

res = (res + T[1][i] * F1[i]) % MOD;

return res;

}