A note on binomial theorem (Q2912442)

In this note the authors recall the well-known Binomial Theorem illustrated by [\textit{M. Abramowitz} (ed.) and \textit{I. A. Stegun} (ed.), Handbook of mathematical functions with formulas, graphs, and mathematical tables. New York etc.: Wiley (1972; Zbl 0543.33001)]: NEWLINE\[NEWLINE (x+a)^n = \sum_{k=0}^{n} {}^nC_k x^k a^{n-k} NEWLINE\]NEWLINE where \( ^nC_k \) is a binomial coefficient and \(n\) is a positive integer; the formula still holds for negative integer -\(n\) which converges for \(|x|<a\).NEWLINENEWLINENEWLINEThey also recall the more general form supplied by [\textit{L. G. Ronald, D. E. Knuth} and \textit{O. Patashnik}, Concrete mathematics: a foundation for computer science. 2nd ed. Amsterdam: Addison-Wesley (1994; Zbl 0836.00001)] as follows: NEWLINE\[NEWLINE (x+a)^r = \sum_{k=0}^{\infty} {}^rC_k x^k a^{r-k} NEWLINE\]NEWLINE where \( ^rC_k \) is a binomial coefficient and \(r\) is a real number.NEWLINENEWLINEThe authors introduce generalised binomial coefficients by using \(\Gamma\)-functions as follows: NEWLINE\[NEWLINE ^{n+\alpha}G_r = \frac{\Gamma(n+\alpha+1)}{\Gamma(n+\alpha+1-r)r!} NEWLINE\]NEWLINE where \(n\) is an integer, \(k=0,1,2,\ldots \) and \(\alpha\) is a nonzero real number satisfying \(|\alpha|< 1\); the authors remark that \( ^{n+\alpha}G_r \) becomes \( ^nC_r \) for \(\alpha = 0\).NEWLINENEWLINEThese newly defined coefficients have the following notable property NEWLINE\[NEWLINE ^{n+\alpha}G_k = \frac{(n+\alpha)(n+\alpha-1) \cdots (n+\alpha-k+1)}{k!} NEWLINE\]NEWLINE that for \( k = n+\alpha \) means \( ^{n+\alpha}G_{n+\alpha} = 1 \), while for \(0 \leq k \leq 2\) becomes, respectively, \( ^{n+\alpha}G_0 = 1\), \( ^{n+\alpha}G_1 = n+\alpha\), \( ^{n+\alpha}G_2 = \frac{(n+\alpha)(n+\alpha-1)}{2!}\).NEWLINENEWLINEFurther interesting properties, such as \( ^{n+\alpha}G_0 + ^{n+\alpha}G_1 + ^{n+\alpha}G_2 + \cdots = 2^{n+\alpha} \) and more complex ones, are also explored. The authors clarify that the introduction of Gamma function helps to find easily the coefficients for negative numbers (except negative integers) and they give some evaluations of \( ^{n+\alpha}G_r \) for non-integer real numbers.NEWLINENEWLINEThe main result of the paper is the following Binomial Theorem for all real numbers: NEWLINE\[NEWLINE (1+x)^{n+\alpha} = \sum_{k=0}^{\infty} {}^{n+\alpha}G_k x^k (|x|< 1) NEWLINE\]NEWLINEgeneralizing the similar version reported by \textit{Eric W. Weisstein} NEWLINE\[NEWLINE (1+x)^r = \sum_{k=0}^{\infty} {}^rC_k x^k NEWLINE\]NEWLINE in [``Binomial Theorem'', \url{http://mathworld.wolfram.com/BinomialTheorem.html}] as supplied for the first time by \textit{George B. Arfken} in 1985.NEWLINENEWLINEBeyond basic differentiability rules easily available, \(e.g.\), in [\textit{Lars V. Ahlfors}, Complex analysis. 2nd ed. Maidenhead, Berkshire: McGraw-Hill (1966; Zbl 0154.31904)], in the proof the authors employ the Maclaurin series pointing out that such method was already used by \textit{K. Ward} [``Series Binomial Theorem'', \url{http://www.trans4mind.com/}].