Example Owed From 1 10
Example Owed From 1 10
+ 3xy
(x
2
+ 1)y = 0. (1)
First, we will seek solutions taking the form
y(x) =
n=0
b
n
x
n+r
.
Substituting this into (1), we nd that
0 = 2
n=0
(n + r)(n + r 1)b
n
x
n+r
+ 3
n=0
(n + r)b
n
x
n+r
n=0
b
n
x
n+r+2
n=0
b
n
x
n+r
=
n=0
[2(n + r)(n + r 1) + 3(n + r) 1]b
n
x
n+r
m=2
b
m2
x
m+r
.
Assuming b
0
= 0For n = 0 and n = 1, we nd that
0 = (2r
2
+ r 1)b
0
, (2)
0 = (2r
2
+ 5r + 2)b
1
. (3)
From (2)which is essentially the indicial equationit follows that r = 1 or r = 1/2. We
are in Case 1 from class, in which there are distinct roots of the indicial equation that do
not dier by an integer. Plugging r = 1 and r = 1/2 into (3), it follows that b
1
= 0.
Furthermore, the following recurrence relation holds
[2(n + r)(n + r 1) + 3(n + r) 1]b
n
b
n2
= 0, for n 2,
which is equivalent to the relation
b
n
=
b
n2
2(n + r)
2
+ (n + r) 1
, for n 2.
It follows that b
2m+1
= 0 for all m 0, and
b
2m
= b
0
m
k=1
1
2(2k + r)
2
+ (2k + r) 1
for all m 1.
Explicitly, for r = 1/2 we have found that b
2m+1
= 0 and
b
2m
= b
0
m
k=1
1
2k(4k + 3)
=
b
0
2
m
m!
k=1
1
4k + 3
.
Therefore, one Frobenius series solution is given by
y
1
(x) = x
1/2
m=0
x
2m
2
m
m!
k=1
1
4k + 3
= x
1/2
1 +
x
2
14
+
x
4
616
+
. (4)
For r = 1 we have found that b
2m+1
= 0 and
b
2m
= b
0
m
k=1
1
2k(4k 3)
=
b
0
2
m
m!
k=1
1
4k 3
.
Hence another Frobenius series solution is given by
y
2
(x) = x
1
m=0
x
2m
2
m
m!
k=1
1
4k 3
= x
1
1 +
x
2
2
+
x
4
40
+
. (5)
Remark In both of the above expressions, we take advantage of the convention that empty
products are 1, in a similar way that you may have seen in which empty sums are 0. In
the current context, we use the following convention
0
k=1
k
= 1,
for any sequence {
k
}, since the set of k 1 which also satisfy k 0 is empty.
By (4) and (5), it is a simple matter to write the general Frobenius series solution up to
order x
r+4
as
y(x) = Ax
1/2
1 +
x
2
14
+
x
4
616
+
+ Bx
1
1 +
x
2
2
+
x
4
40
+