Solving Recurrence Relation Homework

In summary, the sequence f_n is defined by f_0=1, f_1=2, and f_n=-2f_{n-1}+15f_{n-2} when n \geq 2. The generating function for this sequence is given by F(x)= \sum_{n \geq 2}f_nx^n. By setting up equations and using algebra, it can be shown that F(x)=\frac{P(x)}{Q(x)}, where P(x)=1+4x and Q(x)=1+2x-15x^2. This can be verified by differentiating the function.
  • #1
pupeye11
100
0

Homework Statement



The sequence [tex]f_n[/tex] is defined by [tex]f_0=1, f_1=2[/tex] and [tex]f_n=-2f_{n-1}+15f_{n-2}[/tex] when [tex]n \geq 2[/tex]. Let

[tex]
F(x)= \sum_{n \geq 2}f_nx^n
[/tex]

be the generating function for the sequence [tex]f_0,f_1,...,f_n,...[/tex]

Find polynomials P(x) and Q(x) such that

[tex]
F(x)=\frac{P(x)}{Q(x)}
[/tex]

The Attempt at a Solution



[tex]
f_n+2f_{n-1}-15f_{n-2}=0
[/tex]

So since we know that [tex]F(x)=f_0+f_1x+f_2x^2+...+f_nx^n+...[/tex]

[tex]
F(x)=f_0+f_1x+f_2x^2+...+f_nx^n+...
[/tex]

[tex]
2xF(x)=2f_0x+2f_1x^2+...+2f_{n-1}x^n+...
[/tex]

[tex]
-15x^2F(x)= -15f_0x^2-...-15f_{n-2}x^n-...
[/tex]

Summing these I get

[tex]
(1+2x-15x^2)F(x)=f_0+(f_1+2f_0)x+(f_2+2f_1-15f_0)x^2+...+(f_n+2f_{n-1}-15f_{n-2})x^n
[/tex]

After some algebra and substituting [tex]f_0=1, f_1=2[/tex] I get

[tex]
F(x)=\frac{1+4x}{1+2x-15x^2}
[/tex]

So

[tex]
P(x)=1+4x
[/tex]

and

[tex]
Q(x)=1+2x-15x^2
[/tex]

Is this correct?
 
Physics news on Phys.org
  • #2
looks reasonable to me, you can always check by diferntiating you function a few times
 

What is a recurrence relation?

A recurrence relation is an equation that defines a sequence where each term is defined in terms of previous terms.

Why is solving recurrence relations important?

Recurrence relations are frequently used in various fields of science, such as computer science, mathematics, and physics, to model and analyze complex systems and phenomena.

What are the steps to solving a recurrence relation?

The steps to solving a recurrence relation are as follows:
1. Identify the pattern of the sequence
2. Write out the first few terms of the sequence
3. Write out the recurrence relation in terms of the previous terms
4. Simplify the recurrence relation if possible
5. Solve for the unknown term(s) using algebra or substitution
6. Write out the explicit formula for the sequence if desired.

What are some common techniques for solving recurrence relations?

Some common techniques for solving recurrence relations include substitution, iteration, generating functions, characteristic equations, and master theorem.

Can recurrence relations be solved using programming?

Yes, recurrence relations can be solved using programming, particularly with the use of dynamic programming techniques. Many programming languages have built-in functions or libraries for solving recurrence relations.

Similar threads

  • Calculus and Beyond Homework Help
Replies
4
Views
301
  • Calculus and Beyond Homework Help
Replies
1
Views
500
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
3K
  • Calculus and Beyond Homework Help
Replies
12
Views
982
  • Calculus and Beyond Homework Help
Replies
24
Views
4K
  • Topology and Analysis
Replies
9
Views
1K
  • Topology and Analysis
Replies
21
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
1K
Back
Top