MathCastle
Differential EquationsSuperchallengeFrobenius & Special Functions

Frobenius & Special Functions · Superchallenge problem

Let j1<j2<j3<⋯j_1 < j_2 < j_3 < \cdots be the positive zeros of the Bessel function J1(x)=∑k≥0(−1)kk! (k+1)!(x2)2k+1J_1(x) = \displaystyle\sum_{k\ge0}\frac{(-1)^k}{k!\,(k+1)!}\left(\frac x2\right)^{2k+1}. Given that 2J1(x)x=∏k≥1(1−x2jk2)\dfrac{2J_1(x)}{x} = \displaystyle\prod_{k\ge1}\left(1 - \frac{x^2}{j_k^2}\right), compute ∑k≥11jk2\displaystyle\sum_{k\ge1}\frac{1}{j_k^2}. Express your answer as a common fraction.