5.20.2 Reduced Riccati with n2

5.20.2.1 Examples

For all other cases, there is direct solution to the reduced Riccati given by Eqworld ode0106 and Dr Dobrushkin web page as

(2)w=x{c1BesselJ(12k,1kabxk)+c2BesselY(12k,1kabxk)ab>0c1BesselI(12k,1kabxk)+c2BesselK(12k,1kabxk)ab<0y=1bwwk=1+n2

If n satisfies constraint that

n2n+4

Is an integer, then the solution y(x) will come out using algebraic, exponential and logarithmic functions (including circular functions, such as sin and cosine). If however, n does not satisfy the above constraint, then (2) can still be used but the solution will come out using Bessel function (also called cylindrical functions).

Hence (2) can be used for any n to solve the special or reduced Riccati ode.

The constraint that n2n+4 is an integer, can also be given by saying that n=4k12k where k=±1,±2,.

When n satisfies this, then as mentioned above Eq (2) gives the solution in algebraic, exponential and logarithmic functions. For all other values, Liouville proved no solution exist in terms of elementary functions.

These n values come out to be n={,4021,,85,43,4,83,125,,4019}. We notice that the limit on both ends goes to n=2 which is the first special case above. Below are two examples to illustrate this. First example will use n that meets this constraint, and the second example will use n that does not meet the constraint.