GATE 2002: THE SOLUTION OF RECURRENCE EQUATION Algorithms 0 Ravi Garg 3 Rep. December 8, 2015 GATE 2002: THE SOLUTION OF RECURRENCE EQUATION T(2^K)=3T(2^K-1)+1,T(1)=1 Ravi Garg edited question January 14, 2016 2 answers ActiveVotedNewestOldest 0 Madhav Purohit (anonymous) January 8, 2016 O(n^log3 base 2) Madhav Purohit answered January 8, 2016 0 Satyajit Bhadange (anonymous) January 8, 2016 is it (3^(2^k))….method….replace 2^k with n….soln o new eqn is 3^n…. Satyajit Bhadange answered January 8, 2016 Toggle fullscreen Write Add image to editor add image from link NamePost answer Follow 1 Question stats ActiveJanuary 14, 2016Views227 timesAnswers2 answersFollowers1 follower Question and answer is powered by AnsPress