Solving Recurrences: a3, a4 & General Formula

In summary: By repeating this process, we can see that the recurrence can be rewritten as:an+1 = 19an + 49an-1This is a linear recurrence with constant coefficients, so we can use the adjoint method to find the general formula for ak.First, we find the characteristic polynomial:x^2 - 19x - 49 = 0(x-26)(x+7) = 0So the characteristic roots are x = 26 and x = -7.The general formula for the recurrence is then given by:ak = c1(26)^k + c2(-
  • #1
tachyon_man
50
0

Homework Statement



a) Find the values of a3 and a4 given the recurrence : an+1:=19an-1+30an-2
a0=0 a1=0 a2=56

b) Use special denationalization recurrence shortcuts and the adjoint method to find the general formula for ak.

c) What pattern would there be for a recurrence of the form cn+1 := kcn-2

Homework Equations


The Attempt at a Solution



a) I can do this step easily. a3=0 a4=1064

Ok, so I'm not sure where to go with b (or c). The way I would usually handle this is with diagonalization. I would find the eigenvalues and eigenvectors and use the PDkP-1 formula and work from there. I've never heard of using adjoints to solve recurrences. Please help!
 
Last edited by a moderator:
Physics news on Phys.org
  • #2


Hi there, thank you for your question! I would be happy to assist you with finding a solution for parts b and c of this problem.

b) Using special denationalization recurrence shortcuts, we can rewrite the given recurrence as follows:

an+1 = 19an-1 + 30an-2

= 19(an + an-1) + 30(an-1 + an-2) - 19an - 30an-1

= 19(an + an-1) + 30(an-1 + an-2) - (19 + 30)an-1 - 30an-2

= 19(an + an-1) + 30(an-1 + an-2) - 49an-1 - 30an-2

= 19an + (19+30)an-1 + 30an-2 - 19an-1 - 30an-2

= 19an + 49an-1

= 19(an-1 + an-2) + 30(an-2 + an-3) - 19an-1 - 30an-2

= 19(an-1 + an-2) + 30(an-2 + an-3) - (19 + 30)an-2 - 30an-3

= 19(an-1 + an-2) + 30(an-2 + an-3) - 49an-2 - 30an-3

= 19an-1 + (19+30)an-2 + 30an-3 - 19an-2 - 30an-3

= 19an-1 + 49an-2

= 19(an-2 + an-3) + 30(an-3 + an-4) - 19an-2 - 30an-3

= 19(an-2 + an-3) + 30(an-3 + an-4) - (19 + 30)an-3 - 30an-4

= 19(an-2 + an-3) + 30(an-3 + an-4) - 49an-3 - 30an-4

= 19an-2 + (19+30)an-3 + 30an-4 - 19an-
 

FAQ: Solving Recurrences: a3, a4 & General Formula

What is the purpose of solving recurrences?

The purpose of solving recurrences is to determine the time complexity of an algorithm or function. By solving a recurrence, we can determine how many operations or steps an algorithm will take to solve a problem of a given size, which is important for analyzing the efficiency and performance of an algorithm.

What are the different methods for solving recurrences?

There are several methods for solving recurrences, including substitution method, recursion tree method, and master theorem. Each method has its own advantages and is suitable for different types of recurrences.

How do you use the substitution method to solve a recurrence?

To use the substitution method, we first make a guess for the solution of the recurrence and then prove our guess using mathematical induction. We substitute our guess into the recurrence and show that it satisfies the recurrence for all values of n. If our guess is correct, we have found the solution to the recurrence.

What is the general formula for solving a recurrence?

The general formula for solving a recurrence depends on the method used. For example, the substitution method involves making a guess for the solution and proving it using mathematical induction. The recursion tree method involves drawing a tree to visualize the recurrence and finding a pattern. The master theorem provides a formula for solving recurrences of a specific form.

Can all recurrences be solved using a general formula?

No, not all recurrences can be solved using a general formula. Some recurrences may require a combination of methods or may not have a closed-form solution. In these cases, approximations or asymptotic bounds can be used to determine the time complexity of the algorithm.

Similar threads

Replies
12
Views
1K
Replies
1
Views
2K
Replies
10
Views
9K
Replies
5
Views
1K
Replies
4
Views
2K
Replies
7
Views
1K
Back
Top