# Kenneth Rosen Edition 7th Exercise 8.2 Question 48 (Page No. 526)

0 votes
18 views

Some linear recurrence relations that do not have constant coefficients can be systematically solved. This is the case for recurrence relations of the form $f (n)a_{n} = g(n)a_{n-1} + h(n).$ Exercises $48–50$ illustrate this.

1. Show that the recurrence relation $f (n)a_{n} = g(n)a_{n-1} + h(n),$ for $n \geq 1,$ and with $a_{0} = C,$ can be reduced to a recurrence relation of the form $b_{n} = b_{n-1} + Q(n)h(n),$ where $b_{n} = g(n + 1)Q(n + 1)a_{n},$ with $Q(n) = \dfrac{(f (1)f (2) \dots f (n - 1))}{(g(1)g(2) \dots g(n))}.$
2. Use part $(A)$ to solve the original recurrence relation to obtain $a_{n} = \dfrac{C +\displaystyle{} \sum_{i = 1}^{n}Q(i)h(i)}{g(n + 1)Q(n + 1)}$

edited

## Related questions

0 votes
0 answers
1
18 views
A new employee at an exciting new software company starts with a salary of $\$50,000$and is promised that at the end of each year her salary will be double her salary of the previous year, with an extra increment of$\$10,000$ for each year she has been with the ... $n^{\text{th}}$ year of employment. Solve this recurrence relation to find her salary for her $n^{\text{th}}$ year of employment.
0 votes
0 answers
2
21 views
Suppose that there are two goats on an island initially.The number of goats on the island doubles every year by natural reproduction, and some goats are either added or removed each year. Construct a recurrence relation for the number of goats on the island at the start of the ... $n^{\text{th}}$ year for each $n \geq 3.$
0 votes
0 answers
3
19 views
Suppose that each pair of a genetically engineered species of rabbits left on an island produces two new pairs of rabbits at the age of $1$ month and six new pairs of rabbits at the age of $2$ months and every month afterward. None of the rabbits ever die or leave ... relation in $(A)$ determine the number of pairs of rabbits on the island $n$ months after one pair is left on the island.
0 votes
0 answers
4
13 views
(Linear algebra required ) Let $A_{n}$ be the $n \times n$ matrix with $2s$ on its main diagonal, $1s$ in all positions next to a diagonal element, and $0s$ everywhere else. Find a recurrence relation for $d_{n},$ the determinant of $A_{n}.$ Solve this recurrence relation to find a formula for $d_{n}.$