sutupidmath said:
Are you trying to find a 'closed' form for the n'th term of this recurrence relation, or what exactly is your question?
Sorry, you'll have to forgive me. Being familiar with where the equation came from I took it for granted. I thought enough information was supplied.
I looked up recurrence relations and I'm pretty confident that this is what I'm looking for, thankyou for that. I'll have to see if the following is a recurrence relation, I noticed in my preliminary search that there are a number of 'types'; which may confuse things for me... I'll look to see if it is the one you mentioned above, given the following information, could you verify the type for me?
Basically, I just want to express S_{n} in terms of n.
S_{n} = 2S_{n-1} + 2n - 4
S_{n} + 2n = 2S_{n-1} + 2n - 4 + 2n<br />
= 2S_{n-1} + 4n - 4 = 2S_{n-1} + 4(n - 1) = 2(S_{n-1} + 2(n - 1))
Since S_{n-1} + 2(n - 1) = 2(S_{n-2} + 2(n-2)
Then S_{n} + 2n = 2(2(S_{n-2} + 2(n-2)))
Working your way down, you eventually arrive at:
S_{n} + 2n = 2^{n-1}(S_{1} + 2(n-(n-1))) = 2^{n-1}(S_{1} + 2)) = 2^{n-1}(2) = 2^n
S_{n} = 2^{n} /left /left – 2n