retagged by
360 views
0 votes
0 votes

Solve these recurrence relations together with the initial conditions given.

  1. $a_{n} = a_{n-1}+ 6a_{n-2} \:\text{for}\: n \geq 2, a_{0} = 3, a_{1} = 6$
  2. $a_{n} = 7a_{n-1}− 10a_{n-2} \:\text{for}\: n \geq 2, a_{0} = 2, a_{1} = 1$
  3. $a_{n} = 6a_{n-1}− 8a_{n-2} \:\text{for}\: n \geq 2, a_{0} = 4, a_{1} = 10$
  4. $a_{n} = 2a_{n-1}− a_{n-2} \:\text{for}\: n \geq 2, a_{0} = 4, a_{1} = 1$
  5. $a_{n} = a_{n-2} \:\text{for}\: n \geq 2, a_{0} = 5, a_{1} = −1$
  6. $a_{n} = −6a_{n-1}− 9a_{n-2} \:\text{for}\: n \geq 2, a_{0} = 3, a_{1} = −3$
  7. $a_{n+2} = −4a_{n+1} + 5a_{n} \:\text{for}\: n \geq 0, a_{0} = 2, a_{1} = 8$
retagged by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
admin asked May 3, 2020
281 views
In how many ways can a $2 \times n$ rectangular checkerboard be tiled using $1 \times 2 \:\text{and}\: 2 \times 2$ pieces?
0 votes
0 votes
0 answers
4
admin asked May 3, 2020
261 views
How many different messages can be transmitted in $n$ microseconds using the two signals described in question $19$ in Section $8.1?$