Formation of the General Equation for a Power Series

Click For Summary

Homework Help Overview

The discussion revolves around the formulation of general equations for a power series using the Method of Frobenius. The original poster expresses difficulty in deriving a general term for the coefficients in the series expansion, particularly in terms of previous coefficients.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • The original poster attempts to derive a general term for the coefficients using a recursive relationship but struggles with expressing it in a summation form. Some participants suggest considering patterns in the coefficients and using double factorial notation to simplify the expression.

Discussion Status

Participants have provided insights into grouping terms and using ellipsis for sequences, as well as introducing double factorial notation. The original poster acknowledges the usefulness of these suggestions and expresses a desire to learn more about the concepts discussed.

Contextual Notes

The original poster notes that the lecturer advised not to focus heavily on this segment due to its minimal weightage, yet they prefer to understand the formulation process. There is an indication of missing information regarding the function needed to relate current coefficients to previous ones.

WhiteTrout
Messages
10
Reaction score
0
So I've gotten into the Method of Frobenius and all; Solved a few questions, however the most inconvenient part would be the formulation of the general equations for the final answer.

Granted, the lecturer told us to not spend so much time on that segment due to its minimal weightage, but I prefer to know.

So, here's one which I am on and about right now;

C_(k+1) = -2Ck/(k+1)(2k-1)

k=0; C1= -2Co/(1)(-1)
k=1; C2= -2C1/(2)(1)
k=2; C3= -2C2/(3)(3)
k=3; C4= -2C3/(4)(5)

Their equivalent in terms of Co being
-2Co/(1)(-1)
(-2)^2 Co/(1)(-1)(2)(1)
(-2)^3 Co/(1)(-1)(2)(1)(3)(3)
(-2)^3 Co/(1)(-1)(2)(1)(3)(3)(4)(5)
respectively.

What I have tried doing was
y= Co [Summation of](-2)^(n+1)/(n+1)!(<missing link>)

I cannot complete it because I don't know any function that allows me to pile up previous values, so that the current will be multiplied by the previous.
However, I am pretty sure that this isn't the correct method, so any help given will be very appriciated.

Also, I would love to hear advice on what to look for when creating the general equation.
Thank you.
 
Physics news on Phys.org
WhiteTrout said:
So I've gotten into the Method of Frobenius and all; Solved a few questions, however the most inconvenient part would be the formulation of the general equations for the final answer.

Granted, the lecturer told us to not spend so much time on that segment due to its minimal weightage, but I prefer to know.

So, here's one which I am on and about right now;

C_(k+1) = -2Ck/(k+1)(2k-1)

k=0; C1= -2Co/(1)(-1)
k=1; C2= -2C1/(2)(1)
k=2; C3= -2C2/(3)(3)
k=3; C4= -2C3/(4)(5)

Their equivalent in terms of Co being
-2Co/(1)(-1)
(-2)^2 Co/(1)(-1)(2)(1)
(-2)^3 Co/(1)(-1)(2)(1)(3)(3)
(-2)^3 Co/(1)(-1)(2)(1)(3)(3)(4)(5)
respectively.

What I have tried doing was
y= Co [Summation of](-2)^(n+1)/(n+1)!(<missing link>)

I cannot complete it because I don't know any function that allows me to pile up previous values, so that the current will be multiplied by the previous.
However, I am pretty sure that this isn't the correct method, so any help given will be very appriciated.

Also, I would love to hear advice on what to look for when creating the general equation.
Thank you.

You can't always write them in closed forms with factorials. Sometimes you need to use the ellipsis (...) to indicate "and so forth". When looking for a pattern is is a good idea not to multiply them out (which you apparently already know:biggrin:) and keep things arising from the same factor together. You have an apparent (1)(2)(3)... sequence and a (1)(3)(5)... sequence. So write it like this (Use the X2 icon for subscripts) for n = 3:

(-2)3c0/(-1){(1)(2)(3)(4)}{(1)(3)(5)}

You have almost got it, grouping the -1 with the powers of -2 and the factorial. So the general term for cn would be written

cn=(-2)n+1c0/((n+1)!(1)(3)(5)...(2n-1))

Sometimes there is no avoiding the ellipsis (the three dots).
 
There's also double factorial notation where [itex]n! = n(n-2)(n-4)\cdots 1[/itex] when n is odd and [itex]n! = n(n-2)(n-4)\cdots 2[/itex] when n is even. 0! and (-1)! are both defined to be 1 to make writing general formulas easier.

You can also write, for example,
[tex]1\cdot 3\cdot 5 \cdots (2k+1) = \frac{1\cdot 2 \cdot 3 \cdots (2k+1)}{2\cdot 4\cdots 2k} = \frac{(2k+1)!}{2^k k!}[/tex]
 
Hello,

LCKurtz: Alright I'll keep that in mind. I had not much prior encounters with ellipsis because I try not to use them; but this and the other advices would be very very helpful to remember in a pinch, thank you very much.

Vela: So that was what I was missing. I have thought about it before, but I didn't know how to express it correctly. Thanks for the insight, I know what to expect now; And for the heads up about double factorials too. The extra knowledge should be useful.


Thank you both for your time.
It has really helped me a great deal.

<edit> I just did some reading into double factorials and I must say that the identities would be useful;
In such case, the above can also be written as (2n+1)! right?
And its even numbered sibling would be (2n)!

I would really like to know more, but I am not around that area yet so I'll just keep it at this point.

Thank you.
 
Last edited:

Similar threads

  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
Replies
12
Views
5K
  • · Replies 22 ·
Replies
22
Views
3K
  • · Replies 3 ·
Replies
3
Views
4K