This is found by replacing each a n in the recurrence by x n. This is the first method capable of solving the Fibonacci sequence in the introduction but the method solves any. Solve the characteristic.
The first part of the definition is the first term of the sequence.
Recursion Tree- Like Masters Theorem Recursion Tree is another method for solving the recurrence relations. Till now we have learned how to write a recurrence equation of an algorithm and solve it using the iteration method. To solve this recursive equation we rst solve the following characteristic equation xd c 1xd 1 c 2xd 2 c 3xn 3 c d 0 144 This equation is obtained by replacing a i by xi in the recursive Equation 143. State the initial term.