- #1
Jim01
- 36
- 0
Homework Statement
Let a0, a1, a2..., be defined by the formula an = 3n + 1, for all integers n >= 0. Show that this sequence satisfies the recurrence relation ak = ak-1 + 3, for all integers k >=1.
Homework Equations
for all integers n >= 0, an = 3n + 1
for all integers k >= 1, ak = ak-1 + 3
The Attempt at a Solution
I have no idea how to proceed. In the one example given us in the book, we are given the initial conditions for each sequence (a1 = 2 and b1 = 1) and the formulas are exactly the same except that one is ak = 3ak-1 and the other is bk = 3bk-1. I am unable to relate the example in thge book to the question.
I have looked on youtube but can only find videos on how to compute terms of a recursively defined sequence, which I know how to do.