4.1 problem 1

4.1.1 Maple step by step solution

Internal problem ID [6917]
Internal file name [OUTPUT/6160_Tuesday_August_09_2022_05_23_42_AM_74600233/index.tex]

Book: Elementary differential equations. Rainville, Bedient, Bedient. Prentice Hall. NJ. 8th edition. 1997.
Section: CHAPTER 18. Power series solutions. 18.4 Indicial Equation with Difference of Roots Nonintegral. Exercises page 365
Problem number: 1.
ODE order: 2.
ODE degree: 1.

The type(s) of ODE detected by this program : "second order series method. Regular singular point. Difference not integer"

Maple gives the following as the ode type

[[_2nd_order, _exact, _linear, _homogeneous]]

\[ \boxed {2 x \left (x +1\right ) y^{\prime \prime }+3 \left (x +1\right ) y^{\prime }-y=0} \] With the expansion point for the power series method at \(x = 0\).

The type of the expansion point is first determined. This is done on the homogeneous part of the ODE. \[ \left (2 x^{2}+2 x \right ) y^{\prime \prime }+\left (3 x +3\right ) y^{\prime }-y = 0 \] The following is summary of singularities for the above ode. Writing the ode as \begin {align*} y^{\prime \prime }+p(x) y^{\prime } + q(x) y &=0 \end {align*}

Where \begin {align*} p(x) &= \frac {3}{2 x}\\ q(x) &= -\frac {1}{2 x \left (x +1\right )}\\ \end {align*}

Table 5: Table \(p(x),q(x)\) singularites.
\(p(x)=\frac {3}{2 x}\)
singularity type
\(x = 0\) \(\text {``regular''}\)
\(q(x)=-\frac {1}{2 x \left (x +1\right )}\)
singularity type
\(x = -1\) \(\text {``regular''}\)
\(x = 0\) \(\text {``regular''}\)

Combining everything together gives the following summary of singularities for the ode as

Regular singular points : \([0, -1, \infty ]\)

Irregular singular points : \([]\)

Since \(x = 0\) is regular singular point, then Frobenius power series is used. The ode is normalized to be \[ 2 x \left (x +1\right ) y^{\prime \prime }+\left (3 x +3\right ) y^{\prime }-y = 0 \] Let the solution be represented as Frobenius power series of the form \[ y = \moverset {\infty }{\munderset {n =0}{\sum }}a_{n} x^{n +r} \] Then \begin{align*} y^{\prime } &= \moverset {\infty }{\munderset {n =0}{\sum }}\left (n +r \right ) a_{n} x^{n +r -1} \\ y^{\prime \prime } &= \moverset {\infty }{\munderset {n =0}{\sum }}\left (n +r \right ) \left (n +r -1\right ) a_{n} x^{n +r -2} \\ \end{align*} Substituting the above back into the ode gives \begin{equation} \tag{1} 2 x \left (x +1\right ) \left (\moverset {\infty }{\munderset {n =0}{\sum }}\left (n +r \right ) \left (n +r -1\right ) a_{n} x^{n +r -2}\right )+\left (3 x +3\right ) \left (\moverset {\infty }{\munderset {n =0}{\sum }}\left (n +r \right ) a_{n} x^{n +r -1}\right )-\left (\moverset {\infty }{\munderset {n =0}{\sum }}a_{n} x^{n +r}\right ) = 0 \end{equation} Which simplifies to \begin{equation} \tag{2A} \left (\moverset {\infty }{\munderset {n =0}{\sum }}2 x^{n +r} a_{n} \left (n +r \right ) \left (n +r -1\right )\right )+\left (\moverset {\infty }{\munderset {n =0}{\sum }}2 x^{n +r -1} a_{n} \left (n +r \right ) \left (n +r -1\right )\right )+\left (\moverset {\infty }{\munderset {n =0}{\sum }}3 x^{n +r} a_{n} \left (n +r \right )\right )+\left (\moverset {\infty }{\munderset {n =0}{\sum }}3 \left (n +r \right ) a_{n} x^{n +r -1}\right )+\moverset {\infty }{\munderset {n =0}{\sum }}\left (-a_{n} x^{n +r}\right ) = 0 \end{equation} The next step is to make all powers of \(x\) be \(n +r -1\) in each summation term. Going over each summation term above with power of \(x\) in it which is not already \(x^{n +r -1}\) and adjusting the power and the corresponding index gives \begin{align*} \moverset {\infty }{\munderset {n =0}{\sum }}2 x^{n +r} a_{n} \left (n +r \right ) \left (n +r -1\right ) &= \moverset {\infty }{\munderset {n =1}{\sum }}2 a_{n -1} \left (n +r -1\right ) \left (n +r -2\right ) x^{n +r -1} \\ \moverset {\infty }{\munderset {n =0}{\sum }}3 x^{n +r} a_{n} \left (n +r \right ) &= \moverset {\infty }{\munderset {n =1}{\sum }}3 a_{n -1} \left (n +r -1\right ) x^{n +r -1} \\ \moverset {\infty }{\munderset {n =0}{\sum }}\left (-a_{n} x^{n +r}\right ) &= \moverset {\infty }{\munderset {n =1}{\sum }}\left (-a_{n -1} x^{n +r -1}\right ) \\ \end{align*} Substituting all the above in Eq (2A) gives the following equation where now all powers of \(x\) are the same and equal to \(n +r -1\). \begin{equation} \tag{2B} \left (\moverset {\infty }{\munderset {n =1}{\sum }}2 a_{n -1} \left (n +r -1\right ) \left (n +r -2\right ) x^{n +r -1}\right )+\left (\moverset {\infty }{\munderset {n =0}{\sum }}2 x^{n +r -1} a_{n} \left (n +r \right ) \left (n +r -1\right )\right )+\left (\moverset {\infty }{\munderset {n =1}{\sum }}3 a_{n -1} \left (n +r -1\right ) x^{n +r -1}\right )+\left (\moverset {\infty }{\munderset {n =0}{\sum }}3 \left (n +r \right ) a_{n} x^{n +r -1}\right )+\moverset {\infty }{\munderset {n =1}{\sum }}\left (-a_{n -1} x^{n +r -1}\right ) = 0 \end{equation} The indicial equation is obtained from \(n = 0\). From Eq (2B) this gives \[ 2 x^{n +r -1} a_{n} \left (n +r \right ) \left (n +r -1\right )+3 \left (n +r \right ) a_{n} x^{n +r -1} = 0 \] When \(n = 0\) the above becomes \[ 2 x^{-1+r} a_{0} r \left (-1+r \right )+3 r a_{0} x^{-1+r} = 0 \] Or \[ \left (2 x^{-1+r} r \left (-1+r \right )+3 r \,x^{-1+r}\right ) a_{0} = 0 \] Since \(a_{0}\neq 0\) then the above simplifies to \[ \left (2 r^{2}+r \right ) x^{-1+r} = 0 \] Since the above is true for all \(x\) then the indicial equation becomes \[ 2 r^{2}+r = 0 \] Solving for \(r\) gives the roots of the indicial equation as \begin {align*} r_1 &= 0\\ r_2 &= -{\frac {1}{2}} \end {align*}

Since \(a_{0}\neq 0\) then the indicial equation becomes \[ \left (2 r^{2}+r \right ) x^{-1+r} = 0 \] Solving for \(r\) gives the roots of the indicial equation as \(\left [0, -{\frac {1}{2}}\right ]\).

Since \(r_1 - r_2 = {\frac {1}{2}}\) is not an integer, then we can construct two linearly independent solutions \begin {align*} y_{1}\left (x \right ) &= x^{r_{1}} \left (\moverset {\infty }{\munderset {n =0}{\sum }}a_{n} x^{n}\right )\\ y_{2}\left (x \right ) &= x^{r_{2}} \left (\moverset {\infty }{\munderset {n =0}{\sum }}b_{n} x^{n}\right ) \end {align*}

Or \begin {align*} y_{1}\left (x \right ) &= \moverset {\infty }{\munderset {n =0}{\sum }}a_{n} x^{n}\\ y_{2}\left (x \right ) &= \moverset {\infty }{\munderset {n =0}{\sum }}b_{n} x^{n -\frac {1}{2}} \end {align*}

We start by finding \(y_{1}\left (x \right )\). Eq (2B) derived above is now used to find all \(a_{n}\) coefficients. The case \(n = 0\) is skipped since it was used to find the roots of the indicial equation. \(a_{0}\) is arbitrary and taken as \(a_{0} = 1\). For \(1\le n\) the recursive equation is \begin{equation} \tag{3} 2 a_{n -1} \left (n +r -1\right ) \left (n +r -2\right )+2 a_{n} \left (n +r \right ) \left (n +r -1\right )+3 a_{n -1} \left (n +r -1\right )+3 a_{n} \left (n +r \right )-a_{n -1} = 0 \end{equation} Solving for \(a_{n}\) from recursive equation (4) gives \[ a_{n} = -\frac {\left (2 n +2 r -3\right ) a_{n -1}}{2 n +1+2 r}\tag {4} \] Which for the root \(r = 0\) becomes \[ a_{n} = \frac {a_{n -1} \left (3-2 n \right )}{2 n +1}\tag {5} \] At this point, it is a good idea to keep track of \(a_{n}\) in a table both before substituting \(r = 0\) and after as more terms are found using the above recursive equation.

\(n\) \(a_{n ,r}\) \(a_{n}\)
\(a_{0}\) \(1\) \(1\)

For \(n = 1\), using the above recursive equation gives \[ a_{1}=\frac {1-2 r}{3+2 r} \] Which for the root \(r = 0\) becomes \[ a_{1}={\frac {1}{3}} \] And the table now becomes

\(n\) \(a_{n ,r}\) \(a_{n}\)
\(a_{0}\) \(1\) \(1\)
\(a_{1}\) \(\frac {1-2 r}{3+2 r}\) \(\frac {1}{3}\)

For \(n = 2\), using the above recursive equation gives \[ a_{2}=\frac {4 r^{2}-1}{4 r^{2}+16 r +15} \] Which for the root \(r = 0\) becomes \[ a_{2}=-{\frac {1}{15}} \] And the table now becomes

\(n\) \(a_{n ,r}\) \(a_{n}\)
\(a_{0}\) \(1\) \(1\)
\(a_{1}\) \(\frac {1-2 r}{3+2 r}\) \(\frac {1}{3}\)
\(a_{2}\) \(\frac {4 r^{2}-1}{4 r^{2}+16 r +15}\) \(-{\frac {1}{15}}\)

For \(n = 3\), using the above recursive equation gives \[ a_{3}=\frac {-4 r^{2}+1}{4 r^{2}+24 r +35} \] Which for the root \(r = 0\) becomes \[ a_{3}={\frac {1}{35}} \] And the table now becomes

\(n\) \(a_{n ,r}\) \(a_{n}\)
\(a_{0}\) \(1\) \(1\)
\(a_{1}\) \(\frac {1-2 r}{3+2 r}\) \(\frac {1}{3}\)
\(a_{2}\) \(\frac {4 r^{2}-1}{4 r^{2}+16 r +15}\) \(-{\frac {1}{15}}\)
\(a_{3}\) \(\frac {-4 r^{2}+1}{4 r^{2}+24 r +35}\) \(\frac {1}{35}\)

For \(n = 4\), using the above recursive equation gives \[ a_{4}=\frac {4 r^{2}-1}{4 r^{2}+32 r +63} \] Which for the root \(r = 0\) becomes \[ a_{4}=-{\frac {1}{63}} \] And the table now becomes

\(n\) \(a_{n ,r}\) \(a_{n}\)
\(a_{0}\) \(1\) \(1\)
\(a_{1}\) \(\frac {1-2 r}{3+2 r}\) \(\frac {1}{3}\)
\(a_{2}\) \(\frac {4 r^{2}-1}{4 r^{2}+16 r +15}\) \(-{\frac {1}{15}}\)
\(a_{3}\) \(\frac {-4 r^{2}+1}{4 r^{2}+24 r +35}\) \(\frac {1}{35}\)
\(a_{4}\) \(\frac {4 r^{2}-1}{4 r^{2}+32 r +63}\) \(-{\frac {1}{63}}\)

For \(n = 5\), using the above recursive equation gives \[ a_{5}=\frac {-4 r^{2}+1}{4 r^{2}+40 r +99} \] Which for the root \(r = 0\) becomes \[ a_{5}={\frac {1}{99}} \] And the table now becomes

\(n\) \(a_{n ,r}\) \(a_{n}\)
\(a_{0}\) \(1\) \(1\)
\(a_{1}\) \(\frac {1-2 r}{3+2 r}\) \(\frac {1}{3}\)
\(a_{2}\) \(\frac {4 r^{2}-1}{4 r^{2}+16 r +15}\) \(-{\frac {1}{15}}\)
\(a_{3}\) \(\frac {-4 r^{2}+1}{4 r^{2}+24 r +35}\) \(\frac {1}{35}\)
\(a_{4}\) \(\frac {4 r^{2}-1}{4 r^{2}+32 r +63}\) \(-{\frac {1}{63}}\)
\(a_{5}\) \(\frac {-4 r^{2}+1}{4 r^{2}+40 r +99}\) \(\frac {1}{99}\)

For \(n = 6\), using the above recursive equation gives \[ a_{6}=\frac {4 r^{2}-1}{4 r^{2}+48 r +143} \] Which for the root \(r = 0\) becomes \[ a_{6}=-{\frac {1}{143}} \] And the table now becomes

\(n\) \(a_{n ,r}\) \(a_{n}\)
\(a_{0}\) \(1\) \(1\)
\(a_{1}\) \(\frac {1-2 r}{3+2 r}\) \(\frac {1}{3}\)
\(a_{2}\) \(\frac {4 r^{2}-1}{4 r^{2}+16 r +15}\) \(-{\frac {1}{15}}\)
\(a_{3}\) \(\frac {-4 r^{2}+1}{4 r^{2}+24 r +35}\) \(\frac {1}{35}\)
\(a_{4}\) \(\frac {4 r^{2}-1}{4 r^{2}+32 r +63}\) \(-{\frac {1}{63}}\)
\(a_{5}\) \(\frac {-4 r^{2}+1}{4 r^{2}+40 r +99}\) \(\frac {1}{99}\)
\(a_{6}\) \(\frac {4 r^{2}-1}{4 r^{2}+48 r +143}\) \(-{\frac {1}{143}}\)

For \(n = 7\), using the above recursive equation gives \[ a_{7}=\frac {-4 r^{2}+1}{4 r^{2}+56 r +195} \] Which for the root \(r = 0\) becomes \[ a_{7}={\frac {1}{195}} \] And the table now becomes

\(n\) \(a_{n ,r}\) \(a_{n}\)
\(a_{0}\) \(1\) \(1\)
\(a_{1}\) \(\frac {1-2 r}{3+2 r}\) \(\frac {1}{3}\)
\(a_{2}\) \(\frac {4 r^{2}-1}{4 r^{2}+16 r +15}\) \(-{\frac {1}{15}}\)
\(a_{3}\) \(\frac {-4 r^{2}+1}{4 r^{2}+24 r +35}\) \(\frac {1}{35}\)
\(a_{4}\) \(\frac {4 r^{2}-1}{4 r^{2}+32 r +63}\) \(-{\frac {1}{63}}\)
\(a_{5}\) \(\frac {-4 r^{2}+1}{4 r^{2}+40 r +99}\) \(\frac {1}{99}\)
\(a_{6}\) \(\frac {4 r^{2}-1}{4 r^{2}+48 r +143}\) \(-{\frac {1}{143}}\)
\(a_{7}\) \(\frac {-4 r^{2}+1}{4 r^{2}+56 r +195}\) \(\frac {1}{195}\)

Using the above table, then the solution \(y_{1}\left (x \right )\) is \begin {align*} y_{1}\left (x \right )&= a_{0}+a_{1} x +a_{2} x^{2}+a_{3} x^{3}+a_{4} x^{4}+a_{5} x^{5}+a_{6} x^{6}+a_{7} x^{7}+a_{8} x^{8}\dots \\ &= 1+\frac {x}{3}-\frac {x^{2}}{15}+\frac {x^{3}}{35}-\frac {x^{4}}{63}+\frac {x^{5}}{99}-\frac {x^{6}}{143}+\frac {x^{7}}{195}+O\left (x^{8}\right ) \end {align*}

Now the second solution \(y_{2}\left (x \right )\) is found. Eq (2B) derived above is now used to find all \(b_{n}\) coefficients. The case \(n = 0\) is skipped since it was used to find the roots of the indicial equation. \(b_{0}\) is arbitrary and taken as \(b_{0} = 1\). For \(1\le n\) the recursive equation is \begin{equation} \tag{3} 2 b_{n -1} \left (n +r -1\right ) \left (n +r -2\right )+2 b_{n} \left (n +r \right ) \left (n +r -1\right )+3 b_{n -1} \left (n +r -1\right )+3 \left (n +r \right ) b_{n}-b_{n -1} = 0 \end{equation} Solving for \(b_{n}\) from recursive equation (4) gives \[ b_{n} = -\frac {\left (2 n +2 r -3\right ) b_{n -1}}{2 n +1+2 r}\tag {4} \] Which for the root \(r = -{\frac {1}{2}}\) becomes \[ b_{n} = -\frac {\left (n -2\right ) b_{n -1}}{n}\tag {5} \] At this point, it is a good idea to keep track of \(b_{n}\) in a table both before substituting \(r = -{\frac {1}{2}}\) and after as more terms are found using the above recursive equation.

\(n\) \(b_{n ,r}\) \(b_{n}\)
\(b_{0}\) \(1\) \(1\)

For \(n = 1\), using the above recursive equation gives \[ b_{1}=\frac {1-2 r}{3+2 r} \] Which for the root \(r = -{\frac {1}{2}}\) becomes \[ b_{1}=1 \] And the table now becomes

\(n\) \(b_{n ,r}\) \(b_{n}\)
\(b_{0}\) \(1\) \(1\)
\(b_{1}\) \(\frac {1-2 r}{3+2 r}\) \(1\)

For \(n = 2\), using the above recursive equation gives \[ b_{2}=\frac {4 r^{2}-1}{4 r^{2}+16 r +15} \] Which for the root \(r = -{\frac {1}{2}}\) becomes \[ b_{2}=0 \] And the table now becomes

\(n\) \(b_{n ,r}\) \(b_{n}\)
\(b_{0}\) \(1\) \(1\)
\(b_{1}\) \(\frac {1-2 r}{3+2 r}\) \(1\)
\(b_{2}\) \(\frac {4 r^{2}-1}{4 r^{2}+16 r +15}\) \(0\)

For \(n = 3\), using the above recursive equation gives \[ b_{3}=\frac {-4 r^{2}+1}{4 r^{2}+24 r +35} \] Which for the root \(r = -{\frac {1}{2}}\) becomes \[ b_{3}=0 \] And the table now becomes

\(n\) \(b_{n ,r}\) \(b_{n}\)
\(b_{0}\) \(1\) \(1\)
\(b_{1}\) \(\frac {1-2 r}{3+2 r}\) \(1\)
\(b_{2}\) \(\frac {4 r^{2}-1}{4 r^{2}+16 r +15}\) \(0\)
\(b_{3}\) \(\frac {-4 r^{2}+1}{4 r^{2}+24 r +35}\) \(0\)

For \(n = 4\), using the above recursive equation gives \[ b_{4}=\frac {4 r^{2}-1}{4 r^{2}+32 r +63} \] Which for the root \(r = -{\frac {1}{2}}\) becomes \[ b_{4}=0 \] And the table now becomes

\(n\) \(b_{n ,r}\) \(b_{n}\)
\(b_{0}\) \(1\) \(1\)
\(b_{1}\) \(\frac {1-2 r}{3+2 r}\) \(1\)
\(b_{2}\) \(\frac {4 r^{2}-1}{4 r^{2}+16 r +15}\) \(0\)
\(b_{3}\) \(\frac {-4 r^{2}+1}{4 r^{2}+24 r +35}\) \(0\)
\(b_{4}\) \(\frac {4 r^{2}-1}{4 r^{2}+32 r +63}\) \(0\)

For \(n = 5\), using the above recursive equation gives \[ b_{5}=\frac {-4 r^{2}+1}{4 r^{2}+40 r +99} \] Which for the root \(r = -{\frac {1}{2}}\) becomes \[ b_{5}=0 \] And the table now becomes

\(n\) \(b_{n ,r}\) \(b_{n}\)
\(b_{0}\) \(1\) \(1\)
\(b_{1}\) \(\frac {1-2 r}{3+2 r}\) \(1\)
\(b_{2}\) \(\frac {4 r^{2}-1}{4 r^{2}+16 r +15}\) \(0\)
\(b_{3}\) \(\frac {-4 r^{2}+1}{4 r^{2}+24 r +35}\) \(0\)
\(b_{4}\) \(\frac {4 r^{2}-1}{4 r^{2}+32 r +63}\) \(0\)
\(b_{5}\) \(\frac {-4 r^{2}+1}{4 r^{2}+40 r +99}\) \(0\)

For \(n = 6\), using the above recursive equation gives \[ b_{6}=\frac {4 r^{2}-1}{4 r^{2}+48 r +143} \] Which for the root \(r = -{\frac {1}{2}}\) becomes \[ b_{6}=0 \] And the table now becomes

\(n\) \(b_{n ,r}\) \(b_{n}\)
\(b_{0}\) \(1\) \(1\)
\(b_{1}\) \(\frac {1-2 r}{3+2 r}\) \(1\)
\(b_{2}\) \(\frac {4 r^{2}-1}{4 r^{2}+16 r +15}\) \(0\)
\(b_{3}\) \(\frac {-4 r^{2}+1}{4 r^{2}+24 r +35}\) \(0\)
\(b_{4}\) \(\frac {4 r^{2}-1}{4 r^{2}+32 r +63}\) \(0\)
\(b_{5}\) \(\frac {-4 r^{2}+1}{4 r^{2}+40 r +99}\) \(0\)
\(b_{6}\) \(\frac {4 r^{2}-1}{4 r^{2}+48 r +143}\) \(0\)

For \(n = 7\), using the above recursive equation gives \[ b_{7}=\frac {-4 r^{2}+1}{4 r^{2}+56 r +195} \] Which for the root \(r = -{\frac {1}{2}}\) becomes \[ b_{7}=0 \] And the table now becomes

\(n\) \(b_{n ,r}\) \(b_{n}\)
\(b_{0}\) \(1\) \(1\)
\(b_{1}\) \(\frac {1-2 r}{3+2 r}\) \(1\)
\(b_{2}\) \(\frac {4 r^{2}-1}{4 r^{2}+16 r +15}\) \(0\)
\(b_{3}\) \(\frac {-4 r^{2}+1}{4 r^{2}+24 r +35}\) \(0\)
\(b_{4}\) \(\frac {4 r^{2}-1}{4 r^{2}+32 r +63}\) \(0\)
\(b_{5}\) \(\frac {-4 r^{2}+1}{4 r^{2}+40 r +99}\) \(0\)
\(b_{6}\) \(\frac {4 r^{2}-1}{4 r^{2}+48 r +143}\) \(0\)
\(b_{7}\) \(\frac {-4 r^{2}+1}{4 r^{2}+56 r +195}\) \(0\)

Using the above table, then the solution \(y_{2}\left (x \right )\) is \begin {align*} y_{2}\left (x \right )&= 1 \left (b_{0}+b_{1} x +b_{2} x^{2}+b_{3} x^{3}+b_{4} x^{4}+b_{5} x^{5}+b_{6} x^{6}+b_{7} x^{7}+b_{8} x^{8}\dots \right ) \\ &= \frac {1+x +O\left (x^{8}\right )}{\sqrt {x}} \end {align*}

Therefore the homogeneous solution is \begin{align*} y_h(x) &= c_{1} y_{1}\left (x \right )+c_{2} y_{2}\left (x \right ) \\ &= c_{1} \left (1+\frac {x}{3}-\frac {x^{2}}{15}+\frac {x^{3}}{35}-\frac {x^{4}}{63}+\frac {x^{5}}{99}-\frac {x^{6}}{143}+\frac {x^{7}}{195}+O\left (x^{8}\right )\right ) + \frac {c_{2} \left (1+x +O\left (x^{8}\right )\right )}{\sqrt {x}} \\ \end{align*} Hence the final solution is \begin{align*} y &= y_h \\ &= c_{1} \left (1+\frac {x}{3}-\frac {x^{2}}{15}+\frac {x^{3}}{35}-\frac {x^{4}}{63}+\frac {x^{5}}{99}-\frac {x^{6}}{143}+\frac {x^{7}}{195}+O\left (x^{8}\right )\right )+\frac {c_{2} \left (1+x +O\left (x^{8}\right )\right )}{\sqrt {x}} \\ \end{align*}

Summary

The solution(s) found are the following \begin{align*} \tag{1} y &= c_{1} \left (1+\frac {x}{3}-\frac {x^{2}}{15}+\frac {x^{3}}{35}-\frac {x^{4}}{63}+\frac {x^{5}}{99}-\frac {x^{6}}{143}+\frac {x^{7}}{195}+O\left (x^{8}\right )\right )+\frac {c_{2} \left (1+x +O\left (x^{8}\right )\right )}{\sqrt {x}} \\ \end{align*}

Verification of solutions

\[ y = c_{1} \left (1+\frac {x}{3}-\frac {x^{2}}{15}+\frac {x^{3}}{35}-\frac {x^{4}}{63}+\frac {x^{5}}{99}-\frac {x^{6}}{143}+\frac {x^{7}}{195}+O\left (x^{8}\right )\right )+\frac {c_{2} \left (1+x +O\left (x^{8}\right )\right )}{\sqrt {x}} \] Verified OK.

4.1.1 Maple step by step solution

\[ \begin {array}{lll} & {} & \textrm {Let's solve}\hspace {3pt} \\ {} & {} & 2 x \left (1+x \right ) \left (\frac {d}{d x}y^{\prime }\right )+\left (3 x +3\right ) y^{\prime }-y=0 \\ \bullet & {} & \textrm {Highest derivative means the order of the ODE is}\hspace {3pt} 2 \\ {} & {} & \frac {d}{d x}y^{\prime } \\ \bullet & {} & \textrm {Isolate 2nd derivative}\hspace {3pt} \\ {} & {} & \frac {d}{d x}y^{\prime }=\frac {y}{2 x \left (1+x \right )}-\frac {3 y^{\prime }}{2 x} \\ \bullet & {} & \textrm {Group terms with}\hspace {3pt} y\hspace {3pt}\textrm {on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linear}\hspace {3pt} \\ {} & {} & \frac {d}{d x}y^{\prime }+\frac {3 y^{\prime }}{2 x}-\frac {y}{2 x \left (1+x \right )}=0 \\ \square & {} & \textrm {Check to see if}\hspace {3pt} x_{0}\hspace {3pt}\textrm {is a regular singular point}\hspace {3pt} \\ {} & \circ & \textrm {Define functions}\hspace {3pt} \\ {} & {} & \left [P_{2}\left (x \right )=\frac {3}{2 x}, P_{3}\left (x \right )=-\frac {1}{2 x \left (1+x \right )}\right ] \\ {} & \circ & \left (1+x \right )\cdot P_{2}\left (x \right )\textrm {is analytic at}\hspace {3pt} x =-1 \\ {} & {} & \left (\left (1+x \right )\cdot P_{2}\left (x \right )\right )\bigg | {\mstack {}{_{x \hiderel {=}-1}}}=0 \\ {} & \circ & \left (1+x \right )^{2}\cdot P_{3}\left (x \right )\textrm {is analytic at}\hspace {3pt} x =-1 \\ {} & {} & \left (\left (1+x \right )^{2}\cdot P_{3}\left (x \right )\right )\bigg | {\mstack {}{_{x \hiderel {=}-1}}}=0 \\ {} & \circ & x =-1\textrm {is a regular singular point}\hspace {3pt} \\ & {} & \textrm {Check to see if}\hspace {3pt} x_{0}\hspace {3pt}\textrm {is a regular singular point}\hspace {3pt} \\ {} & {} & x_{0}=-1 \\ \bullet & {} & \textrm {Multiply by denominators}\hspace {3pt} \\ {} & {} & 2 x \left (1+x \right ) \left (\frac {d}{d x}y^{\prime }\right )+\left (3 x +3\right ) y^{\prime }-y=0 \\ \bullet & {} & \textrm {Change variables using}\hspace {3pt} x =u -1\hspace {3pt}\textrm {so that the regular singular point is at}\hspace {3pt} u =0 \\ {} & {} & \left (2 u^{2}-2 u \right ) \left (\frac {d}{d u}\frac {d}{d u}y \left (u \right )\right )+3 u \left (\frac {d}{d u}y \left (u \right )\right )-y \left (u \right )=0 \\ \bullet & {} & \textrm {Assume series solution for}\hspace {3pt} y \left (u \right ) \\ {} & {} & y \left (u \right )=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} u^{k +r} \\ \square & {} & \textrm {Rewrite ODE with series expansions}\hspace {3pt} \\ {} & \circ & \textrm {Convert}\hspace {3pt} u \cdot \left (\frac {d}{d u}y \left (u \right )\right )\hspace {3pt}\textrm {to series expansion}\hspace {3pt} \\ {} & {} & u \cdot \left (\frac {d}{d u}y \left (u \right )\right )=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} \left (k +r \right ) u^{k +r} \\ {} & \circ & \textrm {Convert}\hspace {3pt} u^{m}\cdot \left (\frac {d}{d u}\frac {d}{d u}y \left (u \right )\right )\hspace {3pt}\textrm {to series expansion for}\hspace {3pt} m =1..2 \\ {} & {} & u^{m}\cdot \left (\frac {d}{d u}\frac {d}{d u}y \left (u \right )\right )=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} \left (k +r \right ) \left (k +r -1\right ) u^{k +r -2+m} \\ {} & \circ & \textrm {Shift index using}\hspace {3pt} k \mathrm {->}k +2-m \\ {} & {} & u^{m}\cdot \left (\frac {d}{d u}\frac {d}{d u}y \left (u \right )\right )=\moverset {\infty }{\munderset {k =-2+m}{\sum }}a_{k +2-m} \left (k +2-m +r \right ) \left (k +1-m +r \right ) u^{k +r} \\ & {} & \textrm {Rewrite ODE with series expansions}\hspace {3pt} \\ {} & {} & -2 a_{0} r \left (-1+r \right ) u^{-1+r}+\left (\moverset {\infty }{\munderset {k =0}{\sum }}\left (-2 a_{k +1} \left (k +r +1\right ) \left (k +r \right )+a_{k} \left (k +r +1\right ) \left (2 k +2 r -1\right )\right ) u^{k +r}\right )=0 \\ \bullet & {} & a_{0}\textrm {cannot be 0 by assumption, giving the indicial equation}\hspace {3pt} \\ {} & {} & -2 r \left (-1+r \right )=0 \\ \bullet & {} & \textrm {Values of r that satisfy the indicial equation}\hspace {3pt} \\ {} & {} & r \in \left \{0, 1\right \} \\ \bullet & {} & \textrm {Each term in the series must be 0, giving the recursion relation}\hspace {3pt} \\ {} & {} & 2 \left (\left (k +r -\frac {1}{2}\right ) a_{k}-a_{k +1} \left (k +r \right )\right ) \left (k +r +1\right )=0 \\ \bullet & {} & \textrm {Recursion relation that defines series solution to ODE}\hspace {3pt} \\ {} & {} & a_{k +1}=\frac {\left (2 k +2 r -1\right ) a_{k}}{2 \left (k +r \right )} \\ \bullet & {} & \textrm {Recursion relation for}\hspace {3pt} r =0 \\ {} & {} & a_{k +1}=\frac {\left (2 k -1\right ) a_{k}}{2 k} \\ \bullet & {} & \textrm {Solution for}\hspace {3pt} r =0 \\ {} & {} & \left [y \left (u \right )=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} u^{k}, a_{k +1}=\frac {\left (2 k -1\right ) a_{k}}{2 k}\right ] \\ \bullet & {} & \textrm {Revert the change of variables}\hspace {3pt} u =1+x \\ {} & {} & \left [y=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} \left (1+x \right )^{k}, a_{k +1}=\frac {\left (2 k -1\right ) a_{k}}{2 k}\right ] \\ \bullet & {} & \textrm {Recursion relation for}\hspace {3pt} r =1 \\ {} & {} & a_{k +1}=\frac {\left (2 k +1\right ) a_{k}}{2 \left (k +1\right )} \\ \bullet & {} & \textrm {Solution for}\hspace {3pt} r =1 \\ {} & {} & \left [y \left (u \right )=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} u^{k +1}, a_{k +1}=\frac {\left (2 k +1\right ) a_{k}}{2 \left (k +1\right )}\right ] \\ \bullet & {} & \textrm {Revert the change of variables}\hspace {3pt} u =1+x \\ {} & {} & \left [y=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} \left (1+x \right )^{k +1}, a_{k +1}=\frac {\left (2 k +1\right ) a_{k}}{2 \left (k +1\right )}\right ] \\ \bullet & {} & \textrm {Combine solutions and rename parameters}\hspace {3pt} \\ {} & {} & \left [y=\left (\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} \left (1+x \right )^{k}\right )+\left (\moverset {\infty }{\munderset {k =0}{\sum }}b_{k} \left (1+x \right )^{k +1}\right ), a_{k +1}=\frac {\left (2 k -1\right ) a_{k}}{2 k}, b_{k +1}=\frac {\left (2 k +1\right ) b_{k}}{2 \left (k +1\right )}\right ] \end {array} \]

Maple trace

`Methods for second order ODEs: 
--- Trying classification methods --- 
trying a quadrature 
checking if the LODE has constant coefficients 
checking if the LODE is of Euler type 
trying a symmetry of the form [xi=0, eta=F(x)] 
<- linear_1 successful`
 

Solution by Maple

Time used: 0.031 (sec). Leaf size: 40

Order:=8; 
dsolve(2*x*(x+1)*diff(y(x),x$2)+3*(x+1)*diff(y(x),x)-y(x)=0,y(x),type='series',x=0);
 

\[ y \left (x \right ) = \frac {c_{1} \left (1+x +\operatorname {O}\left (x^{8}\right )\right )}{\sqrt {x}}+c_{2} \left (1+\frac {1}{3} x -\frac {1}{15} x^{2}+\frac {1}{35} x^{3}-\frac {1}{63} x^{4}+\frac {1}{99} x^{5}-\frac {1}{143} x^{6}+\frac {1}{195} x^{7}+\operatorname {O}\left (x^{8}\right )\right ) \]

Solution by Mathematica

Time used: 0.006 (sec). Leaf size: 67

AsymptoticDSolveValue[2*x*(x+1)*y''[x]+3*(x+1)*y'[x]-y[x]==0,y[x],{x,0,7}]
 

\[ y(x)\to c_1 \left (\frac {x^7}{195}-\frac {x^6}{143}+\frac {x^5}{99}-\frac {x^4}{63}+\frac {x^3}{35}-\frac {x^2}{15}+\frac {x}{3}+1\right )+\frac {c_2 (x+1)}{\sqrt {x}} \]