Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Find Nth term (A matrix exponentiation example)

We are given a recursive function that describes Nth terms in the form of other terms. In this article, we have taken specific examples. 

Now you are given n, and you have to find out nth term using the above formula.



Examples: 

Input : n = 2
Output : 5

Input : n = 3
Output :13

Prerequisite : 



Basic Approach: This problem can be solved by simply just iterating over the n terms. Every time you find a term, using this term find the next one, and so on. But the time complexity of this problem is of order O(n).

Optimized Approach:
All such problems where a term is a function of other terms in a linear fashion. Then these can be solved using the Matrix (Please refer: Matrix Exponentiation ). First, we make a transformation matrix and then just use matrix exponentiation to find the Nth term. 

Step by Step method includes: 

  • Step 1. Determine k the number of terms on which T(i) depends. 
    For our example, T(i) depends on two terms. So, k = 2
  • Step 2. Determine initial values 
    As in this article T0=1, T1=1 are given.
  • Step 3. Determine TM, the transformation matrix. 
    This is the most important step in solving recurrence relations. In this step, we have to make the matrix of dimension k*k. 
    Such that 
    T(i)=TM*(initial value vector)

Here initial value vector is the vector that contains an initial value. We name this vector as initial. 

Below is the program to implement the above approach. 

// CPP program to find n-th term of a recursive
// function using matrix exponentiation.
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000009
 
#define ll long long int
 
ll power(ll n)
{
    if (n <= 1)
        return 1;
 
    // This power function returns first row of
    // {Transformation Matrix}^n-1*Initial Vector
    n--;
 
    // This is an identity matrix.
    ll res[2][2] = { 1, 0, 0, 1 };
 
    // this is Transformation matrix.
    ll tMat[2][2] = { 2, 3, 1, 0 };
 
    // Matrix exponentiation to calculate power of {tMat}^n-1
    // store res in "res" matrix.
    while (n) {
 
        if (n & 1) {
            ll tmp[2][2];
            tmp[0][0] = (res[0][0] * tMat[0][0] + res[0][1] * tMat[1][0]) % MOD;
            tmp[0][1] = (res[0][0] * tMat[0][1] + res[0][1] * tMat[1][1]) % MOD;
            tmp[1][0] = (res[1][0] * tMat[0][0] + res[1][1] * tMat[1][0]) % MOD;
            tmp[1][1] = (res[1][0] * tMat[0][1] + res[1][1] * tMat[1][1]) % MOD;
            res[0][0] = tmp[0][0];
            res[0][1] = tmp[0][1];
            res[1][0] = tmp[1][0];
            res[1][1] = tmp[1][1];
        }
        n = n / 2;
        ll tmp[2][2];
        tmp[0][0] = (tMat[0][0] * tMat[0][0] + tMat[0][1] * tMat[1][0]) % MOD;
        tmp[0][1] = (tMat[0][0] * tMat[0][1] + tMat[0][1] * tMat[1][1]) % MOD;
        tmp[1][0] = (tMat[1][0] * tMat[0][0] + tMat[1][1] * tMat[1][0]) % MOD;
        tmp[1][1] = (tMat[1][0] * tMat[0][1] + tMat[1][1] * tMat[1][1]) % MOD;
        tMat[0][0] = tmp[0][0];
        tMat[0][1] = tmp[0][1];
        tMat[1][0] = tmp[1][0];
        tMat[1][1] = tmp[1][1];
    }
 
    // res store {Transformation matrix}^n-1
    // hence will be first row of res*Initial Vector.
    return (res[0][0] * 1 + res[0][1] * 1) % MOD;
}
 
// Driver code
int main()
{
    ll n = 3;
    cout << power(n);
    return 0;
}

                    

                    

                        
                        
 
                    

                

                







                

                    

                        

                            

                                

                                    
                                    

                                    
                                    
                                    

                                    
                                    

                                    
                                    
                                    
                                

                            

                        

                    

                    




// Java program to find n-th term of a recursive


// function using matrix exponentiation.



class GfG {



 



    static int MAX = 100;




    static int MOD = 1000000009;




    static int power(int n)




    {




        if (n <= 1) {




            return 1;




        }



 



        // This power function returns first row of




        // {Transformation Matrix}^n-1*Initial Vector




        n--;



 



        // This is an identity matrix.




        int res[][] = { { 1, 0 }, { 0, 1 } };



 



        // this is Transformation matrix.




        int tMat[][] = { { 2, 3 }, { 1, 0 } };



 



        // Matrix exponentiation to calculate power of {tMat}^n-1




        // store res in "res" matrix.




        while (n > 0) {



 



            if (n % 2 == 1) {




                int tmp[][] = new int[2][2];




                tmp[0][0] = (res[0][0] * tMat[0][0]




                             + res[0][1] * tMat[1][0])




                            % MOD;




                tmp[0][1] = (res[0][0] * tMat[0][1]




                             + res[0][1] * tMat[1][1])




                            % MOD;




                tmp[1][0] = (res[1][0] * tMat[0][0]




                             + res[1][1] * tMat[1][0])




                            % MOD;




                tmp[1][1] = (res[1][0] * tMat[0][1]




                             + res[1][1] * tMat[1][1])




                            % MOD;




                res[0][0] = tmp[0][0];




                res[0][1] = tmp[0][1];




                res[1][0] = tmp[1][0];




                res[1][1] = tmp[1][1];




            }



 



            n = n / 2;




            int tmp[][] = new int[2][2];




            tmp[0][0] = (tMat[0][0] * tMat[0][0]




                         + tMat[0][1] * tMat[1][0])




                        % MOD;




            tmp[0][1] = (tMat[0][0] * tMat[0][1]




                         + tMat[0][1] * tMat[1][1])




                        % MOD;




            tmp[1][0] = (tMat[1][0] * tMat[0][0]




                         + tMat[1][1] * tMat[1][0])




                        % MOD;




            tmp[1][1] = (tMat[1][0] * tMat[0][1]




                         + tMat[1][1] * tMat[1][1])




                        % MOD;




            tMat[0][0] = tmp[0][0];




            tMat[0][1] = tmp[0][1];




            tMat[1][0] = tmp[1][0];




            tMat[1][1] = tmp[1][1];




        }



 



        // res store {Transformation matrix}^n-1




        // hence wiint be first row of res*Initial Vector.




        return (res[0][0] * 1 + res[0][1] * 1) % MOD;




    }



 



    // Driver code




    public static void main(String[] args)




    {




        int n = 3;




        System.out.println(power(n));




    }



}


 


// This code contributed by Rajput-Ji



                    
    
                    

                

                

                    

                        
                        

                    

                    

                        
                        
 
                    

                

                







                

                    

                        

                            

                                

                                    
                                    

                                    
                                    
                                    

                                    
                                    

                                    
                                    
                                    
                                

                            

                        

                    

                    




# Python3 program to find n-th term of a recursive


# function using matrix exponentiation.



MOD = 1000000009;



 



def power(n):




    if (n <= 1):




        return 1;



 



    # This power function returns first row of




    # {Transformation Matrix}^n-1 * Initial Vector




    n-= 1;



 



    # This is an identity matrix.




    res = [[1, 0], [0, 1]];



 



    # this is Transformation matrix.




    tMat = [[2, 3], [1, 0]];



 



    # Matrix exponentiation to calculate 




    # power of {tMat}^n-1 store res in "res" matrix.




    while (n):




        if (n & 1):




            tmp = [[0 for x in range(2)] for y in range(2)];




            tmp[0][0] = (res[0][0] * tMat[0][0] +




                        res[0][1] * tMat[1][0]) % MOD;




            tmp[0][1] = (res[0][0] * tMat[0][1] +




                        res[0][1] * tMat[1][1]) % MOD;




            tmp[1][0] = (res[1][0] * tMat[0][0] +




                        res[1][1] * tMat[1][0]) % MOD;




            tmp[1][1] = (res[1][0] * tMat[0][1] +




                        res[1][1] * tMat[1][1]) % MOD;




            res[0][0] = tmp[0][0];




            res[0][1] = tmp[0][1];




            res[1][0] = tmp[1][0];




            res[1][1] = tmp[1][1];




     



        n = n // 2;




        tmp = [[0 for x in range(2)] for y in range(2)];




        tmp[0][0] = (tMat[0][0] * tMat[0][0] +




                    tMat[0][1] * tMat[1][0]) % MOD;




        tmp[0][1] = (tMat[0][0] * tMat[0][1] +




                    tMat[0][1] * tMat[1][1]) % MOD;




        tmp[1][0] = (tMat[1][0] * tMat[0][0] +




                    tMat[1][1] * tMat[1][0]) % MOD;




        tmp[1][1] = (tMat[1][0] * tMat[0][1] +




                    tMat[1][1] * tMat[1][1]) % MOD;




        tMat[0][0] = tmp[0][0];




        tMat[0][1] = tmp[0][1];




        tMat[1][0] = tmp[1][0];




        tMat[1][1] = tmp[1][1];



 



    # res store {Transformation matrix}^n-1




    # hence will be first row of res * Initial Vector.




    return (res[0][0] * 1 + res[0][1] * 1) % MOD;



 


# Driver code



n = 3;




print(power(n));




     


# This code is contributed by mits



                    
    
                    

                

                

                    

                        
                        

                    

                    

                        
                        
 
                    

                

                







                

                    

                        

                            

                                

                                    
                                    

                                    
                                    
                                    

                                    
                                    

                                    
                                    
                                    
                                

                            

                        

                    

                    




// C# program to find n-th term of a recursive


// function using matrix exponentiation.



using System;



 



class GfG {



 



    // static int MAX = 100;




    static int MOD = 1000000009;




    static int power(int n)




    {




        if (n <= 1) {




            return 1;




        }



 



        // This power function returns first row of




        // {Transformation Matrix}^n-1*Initial Vector




        n--;



 



        // This is an identity matrix.




        int[, ] res = { { 1, 0 }, { 0, 1 } };



 



        // this is Transformation matrix.




        int[, ] tMat = { { 2, 3 }, { 1, 0 } };



 



        // Matrix exponentiation to calculate power of {tMat}^n-1




        // store res in "res" matrix.




        while (n > 0) {



 



            if (n % 2 == 1) {




                int[, ] tmp = new int[2, 2];




                tmp[0, 0] = (res[0, 0] * tMat[0, 0]




                             + res[0, 1] * tMat[1, 0])




                            % MOD;




                tmp[0, 1] = (res[0, 0] * tMat[0, 1]




                             + res[0, 1] * tMat[1, 1])




                            % MOD;




                tmp[1, 0] = (res[1, 0] * tMat[0, 0]




                             + res[1, 1] * tMat[1, 0])




                            % MOD;




                tmp[1, 1] = (res[1, 0] * tMat[0, 1]




                             + res[1, 1] * tMat[1, 1])




                            % MOD;




                res[0, 0] = tmp[0, 0];




                res[0, 1] = tmp[0, 1];




                res[1, 0] = tmp[1, 0];




                res[1, 1] = tmp[1, 1];




            }



 



            n = n / 2;




            int[, ] tmp1 = new int[2, 2];




            tmp1[0, 0] = (tMat[0, 0] * tMat[0, 0]




                          + tMat[0, 1] * tMat[1, 0])




                         % MOD;




            tmp1[0, 1] = (tMat[0, 0] * tMat[0, 1]




                          + tMat[0, 1] * tMat[1, 1])




                         % MOD;




            tmp1[1, 0] = (tMat[1, 0] * tMat[0, 0]




                          + tMat[1, 1] * tMat[1, 0])




                         % MOD;




            tmp1[1, 1] = (tMat[1, 0] * tMat[0, 1]




                          + tMat[1, 1] * tMat[1, 1])




                         % MOD;




            tMat[0, 0] = tmp1[0, 0];




            tMat[0, 1] = tmp1[0, 1];




            tMat[1, 0] = tmp1[1, 0];




            tMat[1, 1] = tmp1[1, 1];




        }



 



        // res store {Transformation matrix}^n-1




        // hence wiint be first row of res*Initial Vector.




        return (res[0, 0] * 1 + res[0, 1] * 1) % MOD;




    }



 



    // Driver code




    public static void Main()




    {




        int n = 3;




        Console.WriteLine(power(n));




    }



}


 


// This code contributed by mits



                    
    
                    

                

                

                    

                        
                        

                    

                    

                        
                        
 
                    

                

                







                

                    

                        

                            

                                

                                    
                                    

                                    
                                    
                                    

                                    
                                    

                                    
                                    
                                    
                                

                            

                        

                    

                    




<?php


// PHP program to find n-th term of a recursive


// function using matrix exponentiation.



$MOD = 1000000009;



 



function power($n)



{



    global $MOD;




    if ($n <= 1)




        return 1;



 



    // This power function returns first row of




    // {Transformation Matrix}^n-1*Initial Vector




    $n--;



 



    // This is an identity matrix.




    $res = array(array(1, 0), array(0, 1));



 



    // this is Transformation matrix.




    $tMat= array(array(2, 3), array(1, 0));



 



    // Matrix exponentiation to calculate 




    // power of {tMat}^n-1 store res in "res" matrix.




    while ($n)




    {




        if ($n & 1) 




        {




            $tmp = array_fill(0, 2, array_fill(0, 2, 0));




            $tmp[0][0] = ($res[0][0] * $tMat[0][0] + 




                          $res[0][1] * $tMat[1][0]) % $MOD;




            $tmp[0][1] = ($res[0][0] * $tMat[0][1] + 




                          $res[0][1] * $tMat[1][1]) % $MOD;




            $tmp[1][0] = ($res[1][0] * $tMat[0][0] + 




                          $res[1][1] * $tMat[1][0]) % $MOD;




            $tmp[1][1] = ($res[1][0] * $tMat[0][1] +




                          $res[1][1] * $tMat[1][1]) % $MOD;




            $res[0][0] = $tmp[0][0];




            $res[0][1] = $tmp[0][1];




            $res[1][0] = $tmp[1][0];




            $res[1][1] = $tmp[1][1];




        }




        $n = (int)($n / 2);




        $tmp = array_fill(0, 2, array_fill(0, 2, 0));




        $tmp[0][0] = ($tMat[0][0] * $tMat[0][0] + 




                      $tMat[0][1] * $tMat[1][0]) % $MOD;




        $tmp[0][1] = ($tMat[0][0] * $tMat[0][1] + 




                      $tMat[0][1] * $tMat[1][1]) % $MOD;




        $tmp[1][0] = ($tMat[1][0] * $tMat[0][0] + 




                      $tMat[1][1] * $tMat[1][0]) % $MOD;




        $tmp[1][1] = ($tMat[1][0] * $tMat[0][1] + 




                      $tMat[1][1] * $tMat[1][1]) % $MOD;




        $tMat[0][0] = $tmp[0][0];




        $tMat[0][1] = $tmp[0][1];




        $tMat[1][0] = $tmp[1][0];




        $tMat[1][1] = $tmp[1][1];




    }



 



    // res store {Transformation matrix}^n-1




    // hence will be first row of res*Initial Vector.




    return ($res[0][0] * 1 + $res[0][1] * 1) % $MOD;



}


 


// Driver code



$n = 3;




echo power($n);




     


// This code is contributed by mits


?>



                    
    
                    

                

                

                    

                        
                        

                    

                    

                        
                        
 
                    

                

                







                

                    

                        

                            

                                

                                    
                                    

                                    
                                    
                                    

                                    
                                    

                                    
                                    
                                    
                                

                            

                        

                    

                    




<script>


 


// Javascript program to find n-th term of a recursive


// function using matrix exponentiation.



var MOD = 1000000009;



 



function power(n)



{



    if (n <= 1)




        return 1;



 



    // This power function returns first row of




    // {Transformation Matrix}^n-1*Initial Vector




    n--;



 



    // This is an identity matrix.




    var res = [[1, 0,], [0, 1]];



 



    // this is Transformation matrix.




    var tMat = [[2, 3],[1, 0]];



 



    // Matrix exponentiation to calculate power of {tMat}^n-1




    // store res in "res" matrix.




    while (n) {



 



        if (n & 1) {




            var tmp = Array.from(Array(2), ()=> Array(2));




            tmp[0][0] = (res[0][0] * tMat[0][0] + res[0][1] * tMat[1][0]) % MOD;




            tmp[0][1] = (res[0][0] * tMat[0][1] + res[0][1] * tMat[1][1]) % MOD;




            tmp[1][0] = (res[1][0] * tMat[0][0] + res[1][1] * tMat[1][0]) % MOD;




            tmp[1][1] = (res[1][0] * tMat[0][1] + res[1][1] * tMat[1][1]) % MOD;




            res[0][0] = tmp[0][0];




            res[0][1] = tmp[0][1];




            res[1][0] = tmp[1][0];




            res[1][1] = tmp[1][1];




        }




        n = parseInt(n / 2);




        var tmp = Array.from(Array(2), ()=> Array(2));




        tmp[0][0] = (tMat[0][0] * tMat[0][0] + tMat[0][1] * tMat[1][0]) % MOD;




        tmp[0][1] = (tMat[0][0] * tMat[0][1] + tMat[0][1] * tMat[1][1]) % MOD;




        tmp[1][0] = (tMat[1][0] * tMat[0][0] + tMat[1][1] * tMat[1][0]) % MOD;




        tmp[1][1] = (tMat[1][0] * tMat[0][1] + tMat[1][1] * tMat[1][1]) % MOD;




        tMat[0][0] = tmp[0][0];




        tMat[0][1] = tmp[0][1];




        tMat[1][0] = tmp[1][0];




        tMat[1][1] = tmp[1][1];




    }



 



    // res store {Transformation matrix}^n-1




    // hence will be first row of res*Initial Vector.




    return (res[0][0] * 1 + res[0][1] * 1) % MOD;



}


 


// Driver code



var n = 3;



document.write( power(n));


 


</script>



                    
    
                    

                

                

                    

                        
                        

                    

                    

                        
                        
 
                    

                

                


Output
13


Time Complexity : O(Log n)
Auxiliary Space: O(m2), where m is the order of the transformation matrix. Here, m is 2.
The same idea is used to find n-th Fibonacci number in O(Log n)

	

        Article Tags : 
        

            Competitive Programming
Divide and Conquer
DSA
Matrix
Recursion        


		
	

	


      

      

          
Recommended Articles

      

      

          
          
1. Nth term where K+1th term is product of Kth term with difference of max and min digit of Kth term

          
2. Find Nth term of the series where each term differs by 6 and 2 alternately

          
3. Find the Nth term of the series where each term f[i] = f[i - 1] - f[i - 2]

          
4. Nth term of a sequence formed by sum of current term with product of its largest and smallest digit

          
5. Nth term of given recurrence relation having each term equal to the product of previous K terms

          
6. First term from given Nth term of the equation F(N) = (2 * F(N - 1)) % 10^9 + 7

          
7. Expected number of moves to reach the end of a board | Matrix Exponentiation

          
8. Matrix Exponentiation

          
9. Find nth term of the Dragon Curve Sequence

          
10. Program to find Nth term of series 1, 3, 12, 60, 360…

          
11. Program to find the Nth term of series  -1, 2, 11, 26, 47......

          
12. Program to find Nth term in the series 0, 0, 2, 1, 4, 2, 6, 3, 8,...

          
13. Program to find Nth term of series 9, 23, 45, 75, 113...

          
14. Program to find Nth term in the series 0, 2, 1, 3, 1, 5, 2, 7, 3,…

          
15. Find Nth term of series 1, 4, 15, 72, 420...

          
16. Find Nth term of the series 0, 2, 4, 8, 12, 18...

          
17. Find Nth term of the series 5, 13, 25, 41, 61...

          
18. Program to find the Nth term of the series 3, 20, 63, 144, 230, ……

          
19. Program to find the Nth term of series 5, 10, 17, 26, 37, 50, 65, 82, ...

          
20. Program to find the Nth term of series 0, 4, 14, 30, 51, 80, 114, 154, 200, ...

          
21. Find Nth term of the series 3, 14, 39, 84...

          
22. Program to find the Nth term of the series 0, 14, 40, 78, 124, ...

          
23. Program to find the Nth term of the series 0, 5, 14, 27, 44, ........

          
24. Find Nth term of the series 1, 8, 54, 384...

          
25. Find Nth term of the series 1, 1, 2, 6, 24...