Monketoo's picture
Add files using upload-large-folder tool
f6876fa verified

$$f^{(n)} = \frac{-x(-1)^n n!}{2(a-x^2)^{n+1}} \quad \text{and} \quad g^{(n)} = \frac{(-1)^n (2n-1)!!}{2^n a^{\frac{2n+1}{2}}}$$

on substituting the above values in eq 4 we'll get

(fg)i=x2k=0i(ik)(1)i(ik)!(2k1)!!(ax2)ik+12ka2k+12 (fg)^i = \frac{-x}{2} \sum_{k=0}^{i} \binom{i}{k} \frac{(-1)^i (i-k)! (2k-1)!!}{(a-x^2)^{i-k+1} 2^k a^{\frac{2k+1}{2}}}

since $i \ge 1$ we have

(fg)i=x2k=0i1(i1k)(1)i1(ik1)!(2k1)!!(ax2)ik2ka2k+12 (fg)^i = \frac{-x}{2} \sum_{k=0}^{i-1} \binom{i-1}{k} \frac{(-1)^{i-1}(i-k-1)!(2k-1)!!}{(a-x^2)^{i-k} 2^k a^{\frac{2k+1}{2}}}

on rearranging and writing the double factorial in terms of Pochammer symbol[8]. i.e $\frac{(2k-1)!!}{2^k} = \left(\frac{1}{2}\right)_k$

we'll get

(fg)i=x(1)i(i1)!2a(ax2)ik=0i1(1x2a)k(12)k (fg)^i = \frac{x (-1)^i (i-1)!}{2\sqrt{a}(a-x^2)^i} \sum_{k=0}^{i-1} \left(1-\frac{x^2}{a}\right)^k \left(\frac{1}{2}\right)_k

(fg)=atanh1(xa) \therefore (fg) = \frac{\partial}{\partial a} \tanh^{-1} \left( \frac{x}{\sqrt{a}} \right)

iaitanh1(xa)=x(1)i(i1)!2a(ax2)ik=0i1(1x2a)k(12)k \therefore \quad \frac{\partial^i}{\partial a^i} \tanh^{-1} \left( \frac{x}{\sqrt{a}} \right) = \frac{x (-1)^i (i-1)!}{2\sqrt{a}(a-x^2)^i} \sum_{k=0}^{i-1} \left(1 - \frac{x^2}{a}\right)^k \left(\frac{1}{2}\right)_k

Proof of Theorem 1

Proof.

H((1a)r(m+1);2r(m+1);1)=n1,n2,n3,,nm+101an1+n2++nm+1(2n1+2n2++2nm+1+1)=01n1,n2,n3,,nm+10(x2a)n1+n2++nm+1dx=am+101dx(ax2)m+1I \begin{aligned} H\left(\left(\frac{1}{a}\right)_{r(m+1)} ; 2r(m+1); 1\right) &= \sum_{n_1, n_2, n_3, \ldots, n_{m+1} \ge 0} \frac{1}{a^{n_1+n_2+\cdots+n_{m+1}}} (2n_1 + 2n_2 + \cdots + 2n_{m+1} + 1) \\ &= \int_0^1 \sum_{n_1, n_2, n_3, \ldots, n_{m+1} \ge 0} \left(\frac{x^2}{a}\right)^{n_1+n_2+\cdots+n_{m+1}} dx \\ &= a^{m+1} \underbrace{\int_0^1 \frac{dx}{(a-x^2)^{m+1}}}_{I} \end{aligned}