in Combinatory retagged by
361 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$
in Combinatory retagged by
by
361 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true