Deriving a Formula for S_{n} in a Recurrence Relation

  • Thread starter Thread starter nobahar
  • Start date Start date
AI Thread Summary
The discussion focuses on deriving a formula for the recurrence relation S_{n} = 2S_{n-1} + (2n-4) with the initial condition S_{1} = 0. Participants clarify that this is a non-homogenous recursive relation and express a desire to find a closed form for S_{n}. The conversation includes a step-by-step breakdown of the derivation process, leading to the conclusion that S_{n} can be expressed as S_{n} = 2^n - 2n. Questions about the origin of the equation and the reasoning behind introducing terms like 2n are also addressed. The thread emphasizes the importance of understanding the types of recurrence relations for proper analysis.
nobahar
Messages
482
Reaction score
2

Homework Statement


I have to derive a formula to determine any value of S_{n}.
S_{n} = 2S_{n-1} + (2n-4)


Homework Equations


S_{1} = 0


The Attempt at a Solution


Somone already showed me a proof.
But it starts:
S_{n} + 2n = 2S_{n-1} +2n-4 + 2n
Okay, from here you can work it out, but why introduce 2n from the outset? How would I know straight off that this is what to do?
Thanks in advance.
 
Physics news on Phys.org
I've barely even touched on such maths, so forgive me if I'm completely off.

Firstly, where did you derive the equation from? What does this equation represent?
If it's just something that you have defined, how can it possibly be proved? By its definition that IS what it's meant to be.
 
nobahar said:

Homework Statement


I have to derive a formula to determine any value of S_{n}.
S_{n} = 2S_{n-1} + (2n-4)


Homework Equations


S_{1} = 0


The Attempt at a Solution


Somone already showed me a proof.
But it starts:
S_{n} + 2n = 2S_{n-1} +2n-4 + 2n
Okay, from here you can work it out, but why introduce 2n from the outset? How would I know straight off that this is what to do?
Thanks in advance.

Hi,

This looks to me like a non-homogenous recursive relation. Are you trying to find a 'closed' form for the n'th term of this recurrence relation, or what exactly is your question?
 
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
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Essentially I just have this problem that I'm stuck on, on a sheet about complex numbers: Show that, for ##|r|<1,## $$1+r\cos(x)+r^2\cos(2x)+r^3\cos(3x)...=\frac{1-r\cos(x)}{1-2r\cos(x)+r^2}$$ My first thought was to express it as a geometric series, where the real part of the sum of the series would be the series you see above: $$1+re^{ix}+r^2e^{2ix}+r^3e^{3ix}...$$ The sum of this series is just: $$\frac{(re^{ix})^n-1}{re^{ix} - 1}$$ I'm having some trouble trying to figure out what to...
Back
Top