Series Solution of an ODE: Finding a Non-Recursive Formula

Click For Summary
The discussion revolves around solving the ordinary differential equation y' = x^2y using a power series approach. The user attempts to find a non-recursive formula for the coefficients in the series expansion y = ∑ a_n x^n. They derive a recursion relation and identify that coefficients a_1 and a_3 must be zero, leading to confusion about the role of a_2 as an arbitrary constant. Clarifications reveal that a_1 and a_2 are indeed zero, leaving a_0 as the only non-vanishing coefficient, which serves as the arbitrary constant in the solution. The main challenge lies in expressing the solution without recursion while addressing the implications of the coefficients.
Mangoes
Messages
92
Reaction score
1

Homework Statement



Solve for y' = x^2y

The Attempt at a Solution



There's something that's been really bothering me about this question and similar ones.

We assume that the solution to the ODE will take the form

y = \sum_{n=0}{a_nx^n}

After finding y', plugging in the expressions into the ODE, and distributing x2,

\sum_{n=1}na_nx^{n-1} - \sum_{n=0}a_nx^{n+2} = 0

I want to eventually combine the summations, so first I make the exponents match.

\sum_{n=0}(n+1)a_{n+1}x^n - \sum_{n=2}a_{n-2}x^n = 0

I need to make the indices match without manipulating exponents, so I just peel off the first two terms (n = 0 and n = 1) from the first summation. After doing so and combining the summations:

\sum_{n=2}((n+1)(a_{n+1} - a_{n-2}))x^n + a_1 + 2a_3x = 0

Now here's where I start becoming uncertain...

The summation begins at n = 2, so the smallest power of x that can come out is x2. Since the RHS is 0,

a_1 = 0
2a_3x = 0

This means that the coefficients a_1 and a_3 must be equal to 0. Also, since the coefficients for all powers of x on the RHS are zero,

(n+1)a_{n+1} - a_{n-2} = 0

Rearranging gives me the recursion formula for n ≥ 2:

a_{n+1} = \frac{c_{n-2}}{n+1}

My end goal in here is to write the sum in a way that doesn't involve any past terms so that there's no recursion. I start plugging in numbers and hope that I see some pattern...

n = 2, a_3 = \frac{a_0}{3}

n = 3, a_4 = \frac{a_1}{5} = 0

n = 4, a_5 = \frac{a_2}{6}

n = 5, a_6 = \frac{a_3}{7} = 0

n = 6, a_7 = \frac{a_4}{8} = \frac{a_1}{5*8}

At this point it's clear that the odd n will give a zero and that I only have to worry about even n.

What bothers me is the term I get when n = 4. I'm not given any information as far as I know about a2 and since the ODE is first-order, there's only one arbitrary constant which I assume is a0 (if I don't assume it's arbitrary then I have no idea what to say about a0 either). So I'm stumped. How do I write a non-recursive formula for the sum with the mystery number a2? What am I missing in here?

Apologies for the lengthy post

EDIT: Disregard the thing I said about odd and even n. n = 7 doesn't equal 0.
 
Last edited:
Physics news on Phys.org
Mangoes said:
The summation begins at n = 2, so the smallest power of x that can come out is x2. Since the RHS is 0,

a_1 = 0
2a_3x = 0

This means that the coefficients a_1 and a_3 must be equal to 0. Also, since the coefficients for all powers of x on the RHS are zero,

I guess there's a typo there. You should have a1 = a2 = 0.
 
Because of the error clamtrox pointed out, you had a3=0, and the n=2 equation then tells you a0=0. So a2 would be the arbitrary constant.

Since you're really supposed to have ##a_1=a_2=0##, the non-vanishing coefficients are ##a_{3k}## (k=0, 1, 2, …), and a0 plays the role of the arbitrary constant.
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

Replies
8
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 16 ·
Replies
16
Views
2K