3.308 problem 1314

3.308.1 Maple step by step solution

Internal problem ID [9641]
Internal file name [OUTPUT/8583_Monday_June_06_2022_04_15_13_AM_36390374/index.tex]

Book: Differential Gleichungen, E. Kamke, 3rd ed. Chelsea Pub. NY, 1948
Section: Chapter 2, linear second order
Problem number: 1314.
ODE order: 2.
ODE degree: 1.

The type(s) of ODE detected by this program : "unknown"

Maple gives the following as the ode type

[[_2nd_order, _with_linear_symmetries]]

Unable to solve or complete the solution.

\[ \boxed {x \left (x^{2}+1\right ) y^{\prime \prime }-\left (2 \left (n -1\right ) x^{2}+2 n -1\right ) y^{\prime }+\left (v +n \right ) \left (-v +n -1\right ) x y=0} \]

3.308.1 Maple step by step solution

\[ \begin {array}{lll} & {} & \textrm {Let's solve}\hspace {3pt} \\ {} & {} & \left (x^{3}+x \right ) \left (\frac {d}{d x}y^{\prime }\right )+\left (\left (-2 n +2\right ) x^{2}-2 n +1\right ) y^{\prime }+\left (v +n \right ) \left (-v +n -1\right ) x 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 {\left (v +n \right ) \left (-v +n -1\right ) y}{x^{2}+1}+\frac {\left (2 x^{2} n -2 x^{2}+2 n -1\right ) y^{\prime }}{x \left (x^{2}+1\right )} \\ \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 {\left (2 x^{2} n -2 x^{2}+2 n -1\right ) y^{\prime }}{x \left (x^{2}+1\right )}+\frac {\left (v +n \right ) \left (-v +n -1\right ) y}{x^{2}+1}=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 {2 x^{2} n -2 x^{2}+2 n -1}{x \left (x^{2}+1\right )}, P_{3}\left (x \right )=\frac {\left (v +n \right ) \left (-v +n -1\right )}{x^{2}+1}\right ] \\ {} & \circ & x \cdot P_{2}\left (x \right )\textrm {is analytic at}\hspace {3pt} x =0 \\ {} & {} & \left (x \cdot P_{2}\left (x \right )\right )\bigg | {\mstack {}{_{x \hiderel {=}0}}}=-2 n +1 \\ {} & \circ & x^{2}\cdot P_{3}\left (x \right )\textrm {is analytic at}\hspace {3pt} x =0 \\ {} & {} & \left (x^{2}\cdot P_{3}\left (x \right )\right )\bigg | {\mstack {}{_{x \hiderel {=}0}}}=0 \\ {} & \circ & x =0\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}=0 \\ \bullet & {} & \textrm {Multiply by denominators}\hspace {3pt} \\ {} & {} & x \left (x^{2}+1\right ) \left (\frac {d}{d x}y^{\prime }\right )+\left (-2 x^{2} n +2 x^{2}-2 n +1\right ) y^{\prime }+\left (v +n \right ) \left (-v +n -1\right ) x y=0 \\ \bullet & {} & \textrm {Assume series solution for}\hspace {3pt} y \\ {} & {} & y=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} x^{k +r} \\ \square & {} & \textrm {Rewrite ODE with series expansions}\hspace {3pt} \\ {} & \circ & \textrm {Convert}\hspace {3pt} x \cdot y\hspace {3pt}\textrm {to series expansion}\hspace {3pt} \\ {} & {} & x \cdot y=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} x^{k +r +1} \\ {} & \circ & \textrm {Shift index using}\hspace {3pt} k \mathrm {->}k -1 \\ {} & {} & x \cdot y=\moverset {\infty }{\munderset {k =1}{\sum }}a_{k -1} x^{k +r} \\ {} & \circ & \textrm {Convert}\hspace {3pt} x^{m}\cdot y^{\prime }\hspace {3pt}\textrm {to series expansion for}\hspace {3pt} m =0..2 \\ {} & {} & x^{m}\cdot y^{\prime }=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} \left (k +r \right ) x^{k +r -1+m} \\ {} & \circ & \textrm {Shift index using}\hspace {3pt} k \mathrm {->}k +1-m \\ {} & {} & x^{m}\cdot y^{\prime }=\moverset {\infty }{\munderset {k =-1+m}{\sum }}a_{k +1-m} \left (k +1-m +r \right ) x^{k +r} \\ {} & \circ & \textrm {Convert}\hspace {3pt} x^{m}\cdot \left (\frac {d}{d x}y^{\prime }\right )\hspace {3pt}\textrm {to series expansion for}\hspace {3pt} m =1..3 \\ {} & {} & x^{m}\cdot \left (\frac {d}{d x}y^{\prime }\right )=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} \left (k +r \right ) \left (k +r -1\right ) x^{k +r -2+m} \\ {} & \circ & \textrm {Shift index using}\hspace {3pt} k \mathrm {->}k +2-m \\ {} & {} & x^{m}\cdot \left (\frac {d}{d x}y^{\prime }\right )=\moverset {\infty }{\munderset {k =-2+m}{\sum }}a_{k +2-m} \left (k +2-m +r \right ) \left (k +1-m +r \right ) x^{k +r} \\ & {} & \textrm {Rewrite ODE with series expansions}\hspace {3pt} \\ {} & {} & a_{0} r \left (r -2 n \right ) x^{-1+r}+a_{1} \left (1+r \right ) \left (1+r -2 n \right ) x^{r}+\left (\moverset {\infty }{\munderset {k =1}{\sum }}\left (a_{k +1} \left (k +r +1\right ) \left (k +1+r -2 n \right )+a_{k -1} \left (k -n +r +v \right ) \left (-v +r -n +k -1\right )\right ) x^{k +r}\right )=0 \\ \bullet & {} & a_{0}\textrm {cannot be 0 by assumption, giving the indicial equation}\hspace {3pt} \\ {} & {} & r \left (r -2 n \right )=0 \\ \bullet & {} & \textrm {Values of r that satisfy the indicial equation}\hspace {3pt} \\ {} & {} & r \in \left \{0, 2 n \right \} \\ \bullet & {} & \textrm {Each term must be 0}\hspace {3pt} \\ {} & {} & a_{1} \left (1+r \right ) \left (1+r -2 n \right )=0 \\ \bullet & {} & \textrm {Each term in the series must be 0, giving the recursion relation}\hspace {3pt} \\ {} & {} & a_{k +1} \left (k +r +1\right ) \left (k +1+r -2 n \right )+a_{k -1} \left (k -n +r +v \right ) \left (-v +r -n +k -1\right )=0 \\ \bullet & {} & \textrm {Shift index using}\hspace {3pt} k \mathrm {->}k +1 \\ {} & {} & a_{k +2} \left (k +2+r \right ) \left (k +2+r -2 n \right )+a_{k} \left (k -n +r +v +1\right ) \left (-v +r -n +k \right )=0 \\ \bullet & {} & \textrm {Recursion relation that defines series solution to ODE}\hspace {3pt} \\ {} & {} & a_{k +2}=-\frac {a_{k} \left (k -n +r +v +1\right ) \left (-v +r -n +k \right )}{\left (k +2+r \right ) \left (k +2+r -2 n \right )} \\ \bullet & {} & \textrm {Recursion relation for}\hspace {3pt} r =0 \\ {} & {} & a_{k +2}=-\frac {a_{k} \left (k -n +1+v \right ) \left (-v -n +k \right )}{\left (k +2\right ) \left (k +2-2 n \right )} \\ \bullet & {} & \textrm {Solution for}\hspace {3pt} r =0 \\ {} & {} & \left [y=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} x^{k}, a_{k +2}=-\frac {a_{k} \left (k -n +1+v \right ) \left (-v -n +k \right )}{\left (k +2\right ) \left (k +2-2 n \right )}, a_{1} \left (-2 n +1\right )=0\right ] \\ \bullet & {} & \textrm {Recursion relation for}\hspace {3pt} r =2 n \\ {} & {} & a_{k +2}=-\frac {a_{k} \left (k +n +v +1\right ) \left (-v +n +k \right )}{\left (k +2+2 n \right ) \left (k +2\right )} \\ \bullet & {} & \textrm {Solution for}\hspace {3pt} r =2 n \\ {} & {} & \left [y=\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} x^{k +2 n}, a_{k +2}=-\frac {a_{k} \left (k +n +v +1\right ) \left (-v +n +k \right )}{\left (k +2+2 n \right ) \left (k +2\right )}, a_{1} \left (2 n +1\right )=0\right ] \\ \bullet & {} & \textrm {Combine solutions and rename parameters}\hspace {3pt} \\ {} & {} & \left [y=\left (\moverset {\infty }{\munderset {k =0}{\sum }}a_{k} x^{k}\right )+\left (\moverset {\infty }{\munderset {k =0}{\sum }}b_{k} x^{k +2 n}\right ), a_{k +2}=-\frac {a_{k} \left (k -n +v +1\right ) \left (-v -n +k \right )}{\left (k +2\right ) \left (k +2-2 n \right )}, a_{1} \left (-2 n +1\right )=0, b_{k +2}=-\frac {b_{k} \left (k +n +1+v \right ) \left (-v +n +k \right )}{\left (k +2+2 n \right ) \left (k +2\right )}, b_{1} \left (2 n +1\right )=0\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)] 
checking if the LODE is missing y 
-> Trying a Liouvillian solution using Kovacics algorithm 
<- No Liouvillian solutions exists 
-> Trying a solution in terms of special functions: 
   -> Bessel 
   -> elliptic 
   -> Legendre 
   -> Kummer 
      -> hyper3: Equivalence to 1F1 under a power @ Moebius 
   -> hypergeometric 
      -> heuristic approach 
      <- heuristic approach successful 
   <- hypergeometric successful 
<- special function solution successful`
 

Solution by Maple

Time used: 0.172 (sec). Leaf size: 33

dsolve(x*(x^2+1)*diff(diff(y(x),x),x)-(2*(n-1)*x^2+2*n-1)*diff(y(x),x)+(v+n)*(-v+n-1)*x*y(x)=0,y(x), singsol=all)
 

\[ y \left (x \right ) = x^{n} \left (\operatorname {LegendreQ}\left (v , n , \sqrt {x^{2}+1}\right ) c_{2} +\operatorname {LegendreP}\left (v , n , \sqrt {x^{2}+1}\right ) c_{1} \right ) \]

Solution by Mathematica

Time used: 0.278 (sec). Leaf size: 75

DSolve[(-1 + n - v)*(n + v)*x*y[x] - (-1 + 2*n + 2*(-1 + n)*x^2)*y'[x] + x*(1 + x^2)*y''[x] == 0,y[x],x,IncludeSingularSolutions -> True]
 

\[ y(x)\to c_1 \operatorname {Hypergeometric2F1}\left (\frac {1}{2} (-n-v),\frac {1}{2} (-n+v+1),1-n,-x^2\right )+c_2 x^{2 n} \operatorname {Hypergeometric2F1}\left (\frac {n-v}{2},\frac {1}{2} (n+v+1),n+1,-x^2\right ) \]