Question 1 of 7: Power-Series Solution of a Second-Order ODE
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
Notes on this paper
National Exams — May 2013 — 04-BS-5 Advanced Mathematics. Three-hour, closed-book exam (one double-sided 8.5"×11" aid sheet permitted; approved Casio/Sharp calculator allowed). Format: seven questions of equal value (20 marks each); any five constitute a complete paper and only the first five appearing in the answer book are marked. All seven are solved below for completeness.
Reference texts: Kreyszig, Advanced Engineering Mathematics (10th ed., Wiley) — power-series solutions of ODEs (Ch. 5), Fourier series and the Fourier transform (Ch. 11), least-squares curve fitting, Lagrange interpolation, Romberg integration and root-finding (Ch. 19); Strang, Introduction to Linear Algebra (6th ed., Wellesley-Cambridge) — the Cayley–Hamilton theorem and matrix inversion.
Question 1: Power-Series Solution of a Second-Order ODE (20 marks)
Given. The linear second-order ODE $(x+4)y''+2xy'+2y=0$; at $x=0$ the leading coefficient $(x+4)$ equals $4\ne0$, so $x=0$ is an ordinary point.
Find. Two linearly independent power-series solutions $y_1(x)$ and $y_2(x)$ about $x=0$.
Approach. Substitute $y=\sum_{n=0}^{\infty}a_nx^n$, shift the summation index of every term so all carry the same power $x^m$, match coefficients to obtain a recurrence for $a_{m+2}$, then generate the even-start solution ($a_0=1,a_1=0$) and the odd-start solution ($a_0=0,a_1=1$).
Substitute the series and align every term on the power $x^m$. With $y=\sum a_nx^n$, $y'=\sum na_nx^{n-1}$, $y''=\sum n(n-1)a_nx^{n-2}$:
$$xy''=\sum_{m=1}^{\infty}(m+1)m\,a_{m+1}x^{m},\qquad 4y''=\sum_{m=0}^{\infty}4(m+2)(m+1)a_{m+2}x^{m},$$
$$2xy'=\sum_{m=1}^{\infty}2m\,a_mx^{m},\qquad 2y=\sum_{m=0}^{\infty}2a_mx^{m}.$$
Match the coefficient of $x^m$ and isolate $a_{m+2}$. Summing all four series and setting the total coefficient of $x^m$ to zero,
$$(m+1)m\,a_{m+1}+4(m+2)(m+1)a_{m+2}+2m\,a_m+2a_m=0.$$
Dividing by $(m+1)$,
$$\boxed{a_{m+2}=-\dfrac{m\,a_{m+1}+2a_m}{4(m+2)}}\qquad(m=0,1,2,\dots)$$
(the $x^0$ balance $8a_2+2a_0=0$ is just this formula at $m=0$, so one recurrence generates every coefficient from $a_0,a_1$.)
Build $y_1$ from $a_0=1,\ a_1=0$. The recurrence gives $a_2=-\tfrac14,\ a_3=\tfrac1{48},\ a_4=\tfrac{11}{384},\ a_5=-\tfrac{49}{7680}$, so
$$y_1(x)=\boxed{1-\dfrac14x^2+\dfrac1{48}x^3+\dfrac{11}{384}x^4-\dfrac{49}{7680}x^5+\cdots}$$
Build $y_2$ from $a_0=0,\ a_1=1$. The same recurrence gives $a_2=0,\ a_3=-\tfrac16,\ a_4=\tfrac1{48},\ a_5=\tfrac{13}{960}$, so
$$y_2(x)=\boxed{x-\dfrac16x^3+\dfrac1{48}x^4+\dfrac{13}{960}x^5+\cdots}$$
Since $y_1(0)=1,\,y_1'(0)=0$ and $y_2(0)=0,\,y_2'(0)=1$, the Wronskian $W(0)=y_1(0)y_2'(0)-y_1'(0)y_2(0)=1\ne0$, so $y_1,y_2$ are linearly independent; the general solution is $y(x)=C_1y_1(x)+C_2y_2(x)$, convergent for $|x|\lt 4$ (the distance to the nearest singular point $x=-4$).