The Proposition is as follows: Construct a sequence of numbers a1 , a2, a3, a4 as follows. Set a1 = 5 then triple each term of the sequence and subtract four to obtain the next term. Prove the nth term is given by the forumula an = 3n + 2.
MY WORK SO FAR: I wrote out some of the sequence: 5, 11, 29, 83 I then created the following statement: Sn = 5, 11, 29, 83... 3 (an - 1) - 4 = 3n + 2 ; as long as n >= 2.
Base Case: n = 2, in the left hand side we get 11 and in the right hand side we get 11.
Inductive Step: fix k: Sk = 5, 11, 29, 83... 3 (ak - 1) - 4 = 3k + 2
Sk+1 = 3(ak + 1 - 1) - 4 = 3k + 1 + 2.
I then tried to put it into the following equation Sk + ak = Sk + 1 But I never can get it to properly equal one another.
All Help would be much appreciated as I'm not looking for a direct answer, rather a helpful explanation and hints towards a correct answer.
Again I am not looking for direct answers
The question is all about the sequence $a_1, a_2, a_3, \ldots .$ There is no mention of taking any sum of these terms; only a rule so that if you know one of the terms (such as $a_{15}$) you can compute the next term (so if you know $a_{15}$ you can compute $a_{16}$).
When they write, "Prove the $n$th term is given by ...," they mean "prove that $a_n$ is ... ."
For example, the first term is $a_1 = 5,$ and indeed when $n = 1$ we see that $$3^n + 2 = 3^1 + 2 = 3 + 2 = 5.$$
But if $n = 2$ then $$3^n + 2 = 3^2 + 2 = 9 + 2 = 11,$$ which we see is the second term of the sequence. And if $n = 3$ then $$3^n + 2 = 3^3 + 2 = 27 + 2 = 29,$$ which is the third term.
If you try to prove that the sum of the first $n$ terms is $3^n + 2,$ you will not succeed, because that theorem is false.
The statement we are actually supposed to prove is that $a_n = 3^n + 2.$ Notice we have already shown it to be true for $n = 1,$ so you can use $n = 1$ rather than $n = 2$ for your base case. For the inductive case you will only need to look at $a_k$ and $a_{k+1}.$