# 7.2: Series Solutions Near an Ordinary Point I

- Last updated

- Save as PDF

- Page ID
- 30749

Many physical applications give rise to second order homogeneous linear differential equations of the form

\[\label{eq:7.2.1} P_0(x)y''+P_1(x)y'+P_2(x)y=0,\]

where \(P_0\), \(P_1\), and \(P_2\) are polynomials. Usually the solutions of these equations can’t be expressed in terms of familiar elementary functions. Therefore we’ll consider the problem of representing solutions of Equation \ref{eq:7.2.1} with series.

We assume throughout that \(P_0\), \(P_1\) and \(P_2\) have no common factors. Then we say that \(x_0\) is an *ordinary point* of Equation \ref{eq:7.2.1} if \(P_0(x_0)\ne0\), or a *singular point* if \(P_0(x_0)=0\). For Legendre’s equation,

\[\label{eq:7.2.2} (1-x^2)y''-2xy'+\alpha(\alpha+1)y=0,\]

\(x_0=1\) and \(x_0=-1\) are singular points and all other points are ordinary points. For Bessel’s equation,

\[x^2y''+xy'+(x^2-\nu^2)y=0, \nonumber \]

\(x_0=0\) is a singular point and all other points are ordinary points. If \(P_0\) is a nonzero constant as in Airy’s equation,

\[\label{eq:7.2.3} y''-xy=0,\]

then every point is an ordinary point.

Since polynomials are continuous everywhere, \(P_1/P_0\) and \(P_2/P_0\) are continuous at any point \(x_0\) that isn’t a zero of \(P_0\). Therefore, if \(x_0\) is an ordinary point of Equation \ref{eq:7.2.1} and \(a_0\) and \(a_1\) are arbitrary real numbers, then the initial value problem

\[\label{eq:7.2.4} P_0(x)y''+P_1(x)y'+P_2(x)y=0, \quad y(x_0)=a_0,\quad y'(x_0)=a_1\]

has a unique solution on the largest open interval that contains \(x_0\) and does not contain any zeros of \(P_0\). To see this, we rewrite the differential equation in Equation \ref{eq:7.2.4} as

\[y''+{P_1(x)\over P_0(x)}y'+{P_2(x)\over P_0(x)}y=0 \nonumber\]

and apply Theorem 5.1.1 with \(p=P_1/P_0\) and \(q=P_2/P_0\). In this section and the next we consider the problem of representing solutions of Equation \ref{eq:7.2.1} by power series that converge for values of \(x\) near an ordinary point \(x_0\).

We state the next theorem without proof.

##### Theorem 7.3.1

Suppose \(P_0\), \(P_1\), and \(P_2\) are polynomials with no common factor and \(P_0\) isn’t identically zero\(.\) Let \(x_0\) be a point such that \(P_0(x_0)\ne0,\) and let \(\rho\) be the distance from \(x_0\) to the nearest zero of \(P_0\) in the complex plane. \((\)If \(P_0\) is constant, then \(\rho=\infty\).\()\) Then every solution of

\[\label{eq:7.2.5} P_0(x)y''+P_1(x)y'+P_2(x)y=0\]

can be represented by a power series

\[\label{eq:7.2.6} y=\sum_{n=0}^\infty a_n(x-x_0)^n\]

that converges at least on the open interval \((x_0-\rho,x_0+\rho)\). \((\) If \(P_0\) is nonconstant\(,\) so that \(\rho\) is necessarily finite\(,\) then the open interval of convergence of \(\eqref{eq:7.2.6}\) may be larger than \((x_0-\rho,x_0+\rho).\) If \(P_0\) is constant then \(\rho=\infty\) and \((x_0-\rho,x_0+\rho)=(-\infty,\infty)\).

We call Equation \ref{eq:7.2.6} a *power series solution in \(x-x_0\)* of Equation \ref{eq:7.2.5}. We’ll now develop a method for finding power series solutions of Equation \ref{eq:7.2.5}. For this purpose we write Equation \ref{eq:7.2.5} as \(Ly=0\), where

\[\label{eq:7.2.7} Ly=P_0y''+P_1y'+P_2y.\]

Theorem 7.3.1 implies that every solution of \(Ly=0\) on \((x_0-\rho,x_0+\rho)\) can be written as

\[y=\sum_{n=0}^\infty a_n(x-x_0)^n. \nonumber\]

Setting \(x=x_0\) in this series and in the series

\[y'=\sum_{n=1}^\infty na_n(x-x_0)^{n-1} \nonumber\]

shows that \(y(x_0)=a_0\) and \(y'(x_0)=a_1\). Since every initial value problem Equation \ref{eq:7.2.4} has a unique solution, this means that \(a_0\) and \(a_1\) can be chosen arbitrarily, and \(a_2\), \(a_3\), …are uniquely determined by them.

To find \(a_2\), \(a_3\), …, we write \(P_0\), \(P_1\), and \(P_2\) in powers of \(x-x_0\), substitute

\[ \begin{align*} y &=\sum^\infty_{n=0}a_n(x-x_0)^n, \\[4pt] y' &=\sum^\infty_{n=1}na_n(x-x_0)^{n-1}, \\[4pt] y''&=\sum^\infty_{n=2}n(n-1)a_n(x-x_0)^{n-2} \end{align*}\]

into Equation \ref{eq:7.2.7}, and collect the coefficients of like powers of \(x-x_0\). This yields

\[\label{eq:7.2.8} Ly=\sum^\infty_{n=0}b_n(x-x_0)^n,\]

where \(\{b_0, b_1, \dots, b_n, \dots\}\) are expressed in terms of \(\{a_0, a_1, \dots,a_n, \dots\}\) and the coefficients of \(P_0\), \(P_1\), and \(P_2\), written in powers of \(x-x_0\). Since Equation \ref{eq:7.2.8} and (a) of Theorem 7.1.6 imply that \(Ly=0\) if and only if \(b_n=0\) for \(n\ge0\), all power series solutions in \(x-x_0\) of \(Ly=0\) can be obtained by choosing \(a_0\) and \(a_1\) arbitrarily and computing \(a_2\), \(a_3\), …, successively so that \(b_n=0\) for \(n\ge0\). For simplicity, we call the power series obtained this way *the power series in \(x-x_0\)* for the general solution of \(Ly=0\), without explicitly identifying the open interval of convergence of the series.

##### Example 7.3.1

Let \(x_0\) be an arbitrary real number. Find the power series in \(x-x_0\) for the general solution of

\[\label{eq:7.2.9} y''+ y=0.\]

**Solution**

Here

\[Ly=y''+y. \nonumber\]

If

\[y=\sum_{n=0}^\infty a_n(x-x_0)^n, \nonumber\]

then

\[y''=\sum_{n=2}^\infty n(n-1)a_n(x-x_0)^{n-2}, \nonumber\]

so

\[Ly=\sum_{n=2}^\infty n(n-1)a_n(x-x_0)^{n-2}+\sum_{n=0}^\infty a_n(x-x_0)^n. \nonumber\]

To collect coefficients of like powers of \(x-x_0\), we shift the summation index in the first sum. This yields

\[Ly=\sum^\infty_{n=0}(n+2)(n+1)a_{n+2}(x-x_0)^n + \sum^\infty_{n=0}a_n(x-x_0)^n =\sum^\infty_{n=0}b_n(x-x_0)^n, \nonumber\]

with

\[b_n=(n+2)(n+1)a_{n+2}+a_n. \nonumber\]

Therefore \(Ly=0\) if and only if

\[\label{eq:7.2.10} a_{n+2}={-a_n\over(n+2)(n+1)},\quad n\ge0,\]

where \(a_0\) and \(a_1\) are arbitrary. Since the indices on the left and right sides of Equation \ref{eq:7.2.10} differ by two, we write Equation \ref{eq:7.2.10} separately for \(n\) even \((n=2m)\) and \(n\) odd \((n=2m+1)\). This yields

\[a_{2m+2} = \dfrac{-a_{2m}}{(2m+2)(2m+1)}, \quad m \ge 0, \label{eq:7.2.11}\]

and

\[a_{2m+3} = {-a_{2m+1}\over(2m+3)(2m+2)},\quad m\ge0. \label{eq:7.2.12}\]

Computing the coefficients of the even powers of \(x-x_0\) from Equation \ref{eq:7.2.11} yields

\[\begin{aligned} a_2 &= -{a_0\over2\cdot1}\\[4pt] a_4 &= -{a_2\over4\cdot3}=-{1\over4\cdot3} \left(-{a_0\over2\cdot1}\right)= {a_0\over4\cdot3\cdot2\cdot1}, \\ a_6 &= -{a_4\over6\cdot5}=-{1\over6\cdot5} \left({a_0\over4\cdot3\cdot2\cdot1}\right) =-{a_0\over6\cdot5\cdot4\cdot3\cdot 2\cdot1},\end{aligned}\nonumber \]

and, in general,

\[\label{eq:7.2.13} a_{2m}=(-1)^m {a_0\over(2m)!}\;,\quad m\ge0.\]

Computing the coefficients of the odd powers of \(x-x_0\) from Equation \ref{eq:7.2.12} yields

\[\begin{aligned} a_3 &= -{a_1\over3\cdot2}\\[4pt] a_5 &= -{a_3\over5\cdot4}=-{1\over5\cdot4} \left(-{a_1\over3\cdot2}\right)= {a_1\over5\cdot4\cdot3\cdot2}, \\ a_7 &= -{a_5\over7\cdot6}=-{1\over7\cdot6} \left({a_1\over5\cdot4\cdot3\cdot2}\right) =-{a_1\over7\cdot6\cdot5\cdot4\cdot 3\cdot2},\end{aligned}\nonumber \]

and, in general,

\[\label{eq:7.2.14} a_{2m+1}={(-1)^ma_1\over(2m+1)!}\quad m\ge0.\]

Thus, the general solution of Equation \ref{eq:7.2.9} can be written as

\[y=\sum_{m=0}^\infty a_{2m}(x-x_0)^{2m}+\sum_{m=0}^\infty a_{2m+1}(x-x_0)^{2m+1}, \nonumber\]

or, from Equation \ref{eq:7.2.13} and Equation \ref{eq:7.2.14}, as

\[\label{eq:7.2.15} y=a_0\sum_{m=0}^\infty(-1)^m{(x-x_0)^{2m}\over(2m)!} +a_1\sum_{m=0}^\infty(-1)^m{(x-x_0)^{2m+1}\over(2m+1)!}.\]

If we recall from calculus that

\[\sum_{m=0}^\infty(-1)^m{(x-x_0)^{2m}\over(2m)!}=\cos(x-x_0) \quad \text{and} \quad \sum_{m=0}^\infty(-1)^m{(x-x_0)^{2m+1}\over(2m+1)!}=\sin(x-x_0), \nonumber\]

then Equation \ref{eq:7.2.15} becomes

\[y=a_0\cos(x-x_0)+a_1\sin(x-x_0), \nonumber\]

which should look familiar.

Equations like Equations \ref{eq:7.2.10}, \ref{eq:7.2.11}, and \ref{eq:7.2.12}, which define a given coefficient in the sequence \(\{a_n\}\) in terms of one or more coefficients with lesser indices are called *recurrence relations*. When we use a recurrence relation to compute terms of a sequence we are computing *recursively*.

In the remainder of this section we consider the problem of finding power series solutions in \(x-x_0\) for equations of the form

\[\label{eq:7.2.16} \left(1+\alpha(x-x_0)^2\right)y''+\beta(x-x_0) y'+\gamma y=0.\]

Many important equations that arise in applications are of this form with \(x_0=0\), including Legendre’s equation Equation \ref{eq:7.2.2}, Airy’s equation Equation \ref{eq:7.2.3}, *Chebyshev’s equation*,

\[(1-x^2)y''-xy'+\alpha^2 y=0, \nonumber\]

and *Hermite’s equation*,

\[y''-2xy'+2\alpha y=0. \nonumber\]

Since

\[P_0(x)=1+\alpha(x-x_0)^2 \nonumber\]

in Equation \ref{eq:7.2.16}, the point \(x_0\) is an ordinary point of Equation \ref{eq:7.2.16}, and Theorem 7.3.1 implies that the solutions of Equation \ref{eq:7.2.16} can be written as power series in \(x-x_0\) that converge on the interval \((x_0-1/\sqrt|\alpha|,x_0+1/\sqrt|\alpha|)\) if \(\alpha\ne0\), or on \((-\infty,\infty)\) if \(\alpha=0\). We’ll see that the coefficients in these power series can be obtained by methods similar to the one used in Example 7.3.1 .

To simplify finding the coefficients, we introduce some notation for products:

\[\prod^s_{j=r}b_j=b_rb_{r+1}\cdots b_s\quad \mbox{if} \quad s\ge r. \nonumber\]

Thus,\[\prod^7_{j=2}b_j=b_2b_3b_4b_5b_6b_7, \nonumber\]

\[\prod^4_{j=0}(2j+1)=(1)(3)(5)(7)(9)=945, \nonumber\]

and\[\prod^2_{j=2}j^2=2^2=4. \nonumber\]

We define\[\prod^s_{j=r}b_j=1\quad \mbox{if}\quad s < r, \nonumber\]

no matter what the form of \(b_j\).##### Example 7.3.2

Find the power series in \(x\) for the general solution of

\[\label{eq:7.2.17} (1+2x^2)y''+6xy'+2y=0.\]

**Solution**

Here

\[Ly=(1+2x^2)y''+6xy'+2y. \nonumber\]

If\[y=\sum_{n=0}^\infty a_nx^n \nonumber\]

then\[y'=\sum_{n=1}^\infty na_nx^{n-1}\quad\mbox{ and }\quad y''=\sum_{n=2}^\infty n(n-1)a_nx^{n-2},\nonumber \]

so\[\begin{aligned} Ly &= (1+2x^2) \sum^\infty_{n=2}n(n-1)a_nx^{n-2}+ 6x \sum^\infty_{n=1}na_nx^{n-1} +2 \sum^\infty_{n=0}a_nx^n\\[4pt] &= \sum_{n=2}^\infty n(n-1)a_nx^{n-2}+\sum_{n=0}^\infty \left[2n(n-1)+6n+2\right]a_nx^n\\[4pt] &= \sum_{n=2}^\infty n(n-1)a_nx^{n-2}+2\sum_{n=0}^\infty(n+1)^2a_nx^n.\end{aligned}\nonumber \]

To collect coefficients of \(x^n\), we shift the summation index in the first sum. This yields\[Ly=\sum_{n=0}^\infty(n+2)(n+1)a_{n+2}x^n+2\sum_{n=0}^\infty(n+1)^2a_nx^n =\sum_{n=0}^\infty b_nx^n, \nonumber\]

with\[b_n=(n+2)(n+1)a_{n+2}+2(n+1)^2a_n,\quad n\ge0. \nonumber\]

To obtain solutions of Equation \ref{eq:7.2.17}, we set \(b_n=0\) for \(n\ge0\). This is equivalent to the recurrence relation\[\label{eq:7.2.18} a_{n+2}=-2{n+1\over n+2}a_n,\quad n\ge0.\]

Since the indices on the left and right differ by two, we write Equation \ref{eq:7.2.18} separately for \(n=2m\) and \(n=2m+1\), as in Example 7.3.1 . This yields\[\begin{align} a_{2m+2} &= -2 {2m+1\over2m+2}a_{2m} =-{2m+1\over m+1}a_{2m},\quad m \ge0,\label{eq:7.2.19} \end{align}\]

and

\[\begin{align} a_{2m+3} &= -2{2m+2\over2m+3}a_{2m+1} =-4{m+1\over2m+3}a_{2m+1},\quad m\ge0. \label{eq:7.2.20}\end{align}\]

Computing the coefficients of even powers of \(x\) from Equation \ref{eq:7.2.19} yields\[\begin{aligned} a_2 &= -{1\over1}a_0,\\[4pt] a_4 &= -{3\over2}a_2=\left(-{3\over2}\right)\left(-{1\over1}\right)a_0 ={1\cdot3\over1\cdot2}a_0, \\[4pt] a_6 &= -{5\over3}a_4= -{5\over3}\left(1\cdot3\over1\cdot2\right)a_0 =-{1\cdot3\cdot5\over1\cdot2\cdot3}a_0, \\[4pt] a_8 &= -{7\over4}a_6=-{7\over4} \left(-{1\cdot3\cdot5\over1\cdot2\cdot3}\right)a_0= {1\cdot3\cdot5\cdot7\over1\cdot2\cdot3\cdot4}a_0.\\\end{aligned}\nonumber \] In general,

\[\label{eq:7.2.21} a_{2m}=(-1)^m{\prod_{j=1}^m(2j-1)\over m!}a_0,\quad m\ge0.\]

(Note that Equation \ref{eq:7.2.21} is correct for \(m=0\) because we defined \(\prod_{j=1}^0b_j=1\) for any \(b_j\).)Computing the coefficients of odd powers of \(x\) from Equation \ref{eq:7.2.20} yields

\[\begin{aligned} a_3 &= -4\,{1\over3}a_1, \\[4pt] a_5 &= -4\,{2\over5}a_3=-4\,{2\over5}\left(-4{1\over3}\right)a_1 =4^2{1\cdot2\over3\cdot5}a_1, \\[4pt] a_7 &= -4\,{3\over7}a_5=-4\,{3\over7}\left( 4^2{1\cdot2\over3\cdot5}\right)a_1= -4^3{1\cdot2\cdot3\over3\cdot5\cdot7}a_1,\\[4pt] a_9 &= -4\, {4\over9}a_7=-4\, {4\over9}\left( 4^3{1\cdot2\cdot3\over3\cdot5\cdot7}\right)a_1= 4^4{1\cdot2\cdot3\cdot4\over3\cdot5\cdot7\cdot9}a_1.\end{aligned}\nonumber \]

In general,\[\label{eq:7.2.22} a_{2m+1}={(-1)^m4^m m!\over\prod_{j=1}^m(2j+1)}a_1,\quad m\ge0.\]

From Equation \ref{eq:7.2.21} and Equation \ref{eq:7.2.22},\[y=a_0 \sum^\infty_{m=0}(-1)^m {\prod_{j=1}^m(2j-1)\over m!}x^{2m} +a_1 \sum^\infty_{m=0}(-1)^m {4^mm!\over\prod_{j=1}^m(2j+1)} x^{2m+1}. \nonumber\]

is the power series in \(x\) for the general solution of Equation \ref{eq:7.2.17}. Since \(P_0(x)=1+2x^2\) has no real zeros, Theorem 5.1.1 implies that every solution of Equation \ref{eq:7.2.17} is defined on \((-\infty,\infty)\). However, since \(P_0(\pm i/\sqrt2)=0\), Theorem 7.3.1 implies only that the power series converges in \((-1/\sqrt2,1/\sqrt2)\) for any choice of \(a_0\) and \(a_1\).

The results in Examples 7.3.1 and 7.3.2 are consequences of the following general theorem.

##### Theorem 7.3.2

The coefficients \(\{a_n\}\) in any solution \(y=\sum_{n=0}^\infty a_n(x-x_0)^n\) of

\[\label{eq:7.2.23} \left(1+\alpha(x-x_0)^2\right)y''+\beta(x-x_0) y'+\gamma y=0\]

satisfy the recurrence relation\[\label{eq:7.2.24} a_{n+2}=-{p(n) \over(n+2)(n+1)}a_n,\quad n\ge0,\]

where\[\label{eq:7.2.25} p(n)=\alpha n(n-1) +\beta n+\gamma.\]

Moreover\(,\) the coefficients of the even and odd powers of \(x-x_0\) can be computed separately as\[ a_{2m+2} = -{p(2m)\over(2m+2)(2m+1)}a_{2m},\quad m\ge0\label{eq:7.2.26}\]

\[ a_{2m+3} = -{p(2m+1)\over(2m+3)(2m+2)}a_{2m+1},\quad m\ge0, \label{eq:7.2.27}\]

where \(a_0\) and \(a_1\) are arbitrary.

**Proof**-
Here

\[Ly=\left(1+\alpha(x-x_0\right)^2)y''+\beta(x-x_0) y'+\gamma y. \nonumber\]

If\[y=\sum_{n=0}^\infty a_n(x-x_0)^n,\nonumber\]

then\[y'=\sum_{n=1}^\infty na_n(x-x_0)^{n-1} \quad\mbox{ and }\quad y''=\sum_{n=2}^\infty n(n-1)a_n(x-x_0)^{n-2}.\nonumber\]

Hence,\[\begin{array}{ccl} Ly &= {\sum_{n=2}^\infty n(n-1)a_n(x-x_0)^{n-2}+ \sum_{n=0}^\infty \left[\alpha n(n-1) +\beta n+\gamma\right]a_n(x-x_0)^n}\\[4pt] &= {\sum_{n=2}^\infty n(n-1)a_n(x-x_0)^{n-2}+\sum_{n=0}^\infty p(n)a_n(x-x_0)^n}, \end{array}\nonumber \]

from Equation \ref{eq:7.2.25}. To collect coefficients of powers of \(x-x_0\), we shift the summation index in the first sum. This yields\[Ly=\sum_{n=0}^\infty \left[(n+2)(n+1)a_{n+2}+p(n)a_n\right](x-x_0)^n.\nonumber\]

Thus, \(Ly=0\) if and only if\[(n+2)(n+1)a_{n+2}+p(n)a_n=0,\quad n\ge0,\nonumber\]

which is equivalent to Equation \ref{eq:7.2.24}. Writing Equation \ref{eq:7.2.24} separately for the cases where \(n=2m\) and \(n=2m+1\) yields Equation \ref{eq:7.2.26} and Equation \ref{eq:7.2.27}.

##### Example 7.3.3

Find the power series in \(x-1\) for the general solution of

\[\label{eq:7.2.28} (2+4x-2x^2)y''-12(x-1)y'-12y=0.\]

**Solution**

We must first write the coefficient \(P_0(x)=2+4x-x^2\) in powers of \(x-1\). To do this, we write \(x=(x-1)+1\) in \(P_0(x)\) and then expand the terms, collecting powers of \(x-1\); thus,

\[\begin{aligned} 2+4x-2x^2 &= 2+4[(x-1)+1]-2[(x-1)+1]^2\\ &= 4-2(x-1)^2.\end{aligned}\nonumber \]

Therefore we can rewrite Equation \ref{eq:7.2.28} as\[\left(4-2(x-1)^2\right)y''-12(x-1)y'-12y=0, \nonumber\]

or, equivalently,\[\left(1-{1\over2}(x-1)^2\right)y''-3(x-1)y'-3y=0. \nonumber \]

This is of the form Equation \ref{eq:7.2.23} with \(\alpha=-1/2\), \(\beta=-3\), and \(\gamma=-3\). Therefore, from Equation \ref{eq:7.2.25}\[p(n)=-{n(n-1)\over2}-3n-3=-{(n+2)(n+3)\over2}.\nonumber \]

Hence, Theorem7.3.2 implies that\[\begin{aligned} a_{2m+2} &= -{p(2m)\over(2m+2)(2m+1)}a_{2m}\\ &= {(2m+2)(2m+3)\over2(2m+2)(2m+1)} a_{2m}={2m+3\over2(2m+1)}a_{2m},\quad m\ge0 \end{aligned} \nonumber \]

and

\[\begin{aligned} a_{2m+3} &= -{p(2m+1)\over(2m+3)(2m+2)}a_{2m+1}\\ &= {(2m+3)(2m+4)\over2 (2m+3)(2m+2)}a_{2m+1}={m+2\over2(m+1)}a_{2m+1},\quad m\ge0.\end{aligned}\nonumber \]

We leave it to you to show that\[a_{2m}={2m+1\over2^m}a_0\quad\mbox{ and }\quad a_{2m+1}={m+1\over2^m}a_1,\quad m\ge0,\nonumber \]

which implies that the power series in \(x-1\) for the general solution of Equation \ref{eq:7.2.28} is\[y=a_0\sum_{m=0}^\infty{2m+1\over2^m}(x-1)^{2m}+a_1\sum_{m=0}^\infty {m+1\over2^m}(x-1)^{2m+1}.\nonumber \]

In the examples considered so far we were able to obtain closed formulas for coefficients in the power series solutions. In some cases this is impossible, and we must settle for computing a finite number of terms in the series. The next example illustrates this with an initial value problem.

##### Example 7.3.4

Compute \(a_0\), \(a_1\), …, \(a_7\) in the series solution \(y=\sum_{n=0}^\infty a_nx^n\) of the initial value problem

\[\label{eq:7.2.29} (1+2x^2)y''+10xy'+8y=0,\quad y(0)=2,\quad y'(0)=-3.\]

**Solution**

Since \(\alpha=2\), \(\beta=10\), and \(\gamma=8\) in Equation \ref{eq:7.2.29},

\[p(n)=2n(n-1)+10n+8=2(n+2)^2.\nonumber\]

Therefore\[a_{n+2}=-2{(n+2)^2\over(n+2)(n+1)}a_n=-2{n+2\over n+1}a_n,\quad n\ge0.\nonumber\]

Writing this equation separately for \(n=2m\) and \(n=2m+1\) yields\[\begin{align} a_{2m+2} = -2{(2m+2)\over2m+1}a_{2m}=-4{m+1\over2m+1}a_{2m},\quad m\ge 0\label{eq:7.2.30}\end{align}\]

\[\begin{align} a_{2m+3} = -2{2m+3\over2m+2}a_{2m+1}=-{2m+3\over m+1}a_{2m+1},\quad m\ge0. \label{eq:7.2.31}\end{align}\]

Starting with \(a_0=y(0)=2\), we compute \(a_2, a_4\), and \(a_6\) from Equation \ref{eq:7.2.30} :\[\begin{aligned} a_2 &= -4\,{1\over1}2=-8,\\[4pt] a_4 &= -4\,{2\over3}(-8)={64\over3},\\[4pt] a_6 &= -4\,{3\over5}\left(64\over3\right)=-{256\over5}.\end{aligned}\nonumber\]

Starting with \(a_1=y'(0)=-3\), we compute \(a_3,a_5\) and \(a_7\) from Equation \ref{eq:7.2.31} :\[\begin{aligned} a_3 &= -{3\over1}(-3)=9,\\[4pt] a_5 &= -{5\over2}9=-{45\over2},\\[4pt] a_7 &= -{7\over3}\left(-{45\over2}\right)={105\over2}.\end{aligned}\nonumber \]

Therefore the solution of Equation \ref{eq:7.2.29} is\[y=2-3x-8x^2+9x^3+{64\over3}x^4-{45\over2}x^5-{256\over5} x^6+{105\over2}x^7+\cdots\;.\nonumber\]

## Using Technology

Computing coefficients recursively as in Example 7.3.4 is tedious. We recommend that you do this kind of computation by writing a short program to implement the appropriate recurrence relation on a calculator or computer. You may wish to do this in verifying examples and doing exercises (identified by the symbol \(C\)) in this chapter that call for numerical computation of the coefficients in series solutions. We obtained the answers to these exercises by using software that can produce answers in the form of rational numbers. However, it is perfectly acceptable - and more practical - to get your answers in decimal form. You can always check them by converting our fractions to decimals.

If you’re interested in actually using series to compute numerical approximations to solutions of a differential equation, then whether or not there’s a simple closed form for the coefficients is essentially irrelevant. For computational purposes it is usually more efficient to start with the given coefficients \(a_0=y(x_0)\) and \(a_1=y'(x_0)\), compute \(a_2\), …, \(a_N\) recursively, and then compute approximate values of the solution from the Taylor polynomial

\[T_N(x)=\sum_{n=0}^Na_n(x-x_0)^n.\nonumber \]

The trick is to decide how to choose \(N\) so the approximation \(y(x)\approx T_N(x)\) is sufficiently accurate on the subinterval of the interval of convergence that you’re interested in. In the computational exercises in this and the next two sections, you will often be asked to obtain the solution of a given problem by numerical integration with software of your choice (see Section 10.1 for a brief discussion of one such method), and to compare the solution obtained in this way with the approximations obtained with \(T_N\) for various values of \(N\). This is a typical textbook kind of exercise, designed to give you insight into how the accuracy of the approximation \(y(x)\approx T_N(x)\) behaves as a function of \(N\) and the interval that you’re working on. In real life, you would choose one or the other of the two methods (numerical integration or series solution). If you choose the method of series solution, then a practical procedure for determining a suitable value of \(N\) is to continue increasing \(N\) until the maximum of \(|T_N-T_{N-1}|\) on the interval of interest is within the margin of error that you’re willing to accept.

In doing computational problems that call for numerical solution of differential equations you should choose the most accurate numerical integration procedure your software supports, and experiment with the step size until you’re confident that the numerical results are sufficiently accurate for the problem at hand.