Well, the thing to do would be to prove the general recursive relationship,
J_{n+1}(x)\,=\,\frac{2n}{x}J_n(x)\,-\,J_{n-1}(x)
using the identity
\frac{d}{dx}[x^n{J_n(x)}]\,=\,x^n{J_{n-1}(x)}
and Bessel's equation.
With what identities or properties of Bessel's function of the first kind is one familiar?
#3
m0nk3y
23
0
We are using Bessel Equations of the first kind.
So I did the recursion relation for 2, 1, and zero.
Like for 2nd i got
p=2
n=0 to inf
(1/(n-1)(n+1+2))(x/2)^(2n+2)
i started doing n=0 though 3 to see a pattern but my TA told us not to do that and just to just the general part which it what i wrote about for Jsub2
I don't know if I am explaining myself right.
Sorry if I am not, and thank you for replying :)
It seems that one was trying to do it inductively, but the TA indicated that one should start with the infinite series for J2(x) and manipulate the terms and show that they can be rearranged to give (2/x)J1(x) - J0(x), which is fine.
I would recommend that at some point try to prove the general recursive relationship, i.e.
Jn+1(x) = (2n/x)Jn(x) - Jn-1(x), using the method proposed by the TA.