2 B21 Sheet 5 A
2 B21 Sheet 5 A
2 B21 Sheet 5 A
n=0
The lowest power of x comes from the first term with n = 0. Hence a0 k = 0
but, since a0 6= 0, the indicial equation gives k = 0 as the unique solution. [1]
Therefore ∞ ∞ ∞
an n xn−1 + an n xn+1 = 2 an xn+3 .
X X X
The only x0 term only exists in the first sum, which means that a1 = 0 and
in general all the odd coefficients vanish. There is an x1 term also only in the
first sum so the coefficient a2 = 0 as well. [2]
Now change the dummy index n so that one sees the same power of x in all
three sums:
∞ ∞ ∞
an+4 (n + 4) xn+3 + an+2 (n + 2) xn+3 = 2 an xn+3 ,
X X X
1
which leads to the recurrence relation
2
2. Look for a solution of the second order differential equation
d2 y dy
(2x + x2 ) 2
+ (1 + x) − p2 y = 0
dx dx
in the form
∞
an xn+k ,
X
y =
n=0
∞
y0 = an (n + k) xn+k−1 ,
X
n=0
∞
y 00 = an (n + k)(n + k − 1) xn+k−2 .
X
[1]
n=0
∞ ∞ ∞
+
X
an (n + k) xn+k−1 +
X
an (n + k) xn+k − p2
X
an xn+k = 0 . [1]
n=0 n=0 n=0
a0 k(2k − 1) = 0 .
3
an+1 (n + k)2 − p2
=− ,
an (n + k + 1)(2n + 2k + 1)
[2]
with k = 0 or k = 12 .
The series converges if, when n → ∞,
a n+1
n+1 x an+1
= |x| < 1 . [1]
an x n
an
This means that
(n + k)2 − p2
1
|x| → |x| < 1 ,
2
(n + k + 1)(2n + 2k + 1)
Tp (x) ≈ 1 + p2 x . [2]
Therefore