Binomial expansion for $(x+a)^n$ for non-integer n I finally figured out that you could differentiate $x^n$ and get $nx^{n-1}$ using the derivative quotient, but that required doing binomial expansion for non-integer values.
The most I can find with binomial expansion is the first, second, last, and second to last terms.
So how do I find something like $(x+a)^{\pi}$?  When differentiating in calculus, I didn't need to find terms after the second because I knew they would all cancel out, but how do you find these terms?
Do they work for negative exponents as well?
And does this work for complex exponents?
Which came first, Euler's method for complex exponents or binomial expansion for complex exponents?

$\newcommand{\bbx}[1]{\,\bbox[15px,border:1px groove navy]{\displaystyle{#1}}\,}
 \newcommand{\braces}[1]{\left\lbrace\,{#1}\,\right\rbrace}
 \newcommand{\bracks}[1]{\left\lbrack\,{#1}\,\right\rbrack}
 \newcommand{\dd}{\mathrm{d}}
 \newcommand{\ds}[1]{{\displaystyle #1}}
 \newcommand{\expo}[1]{\,\mathrm{e}^{#1}\,}
 \newcommand{\ic}{\mathrm{i}}
 \newcommand{\on}[1]{\operatorname{#1}}
 \newcommand{\pars}[1]{\left(\,{#1}\,\right)}
 \newcommand{\partiald}[3][]{\frac{\partial^{#1} #2}{\partial #3^{#1}}}
 \newcommand{\root}[2][]{\,\sqrt[#1]{\,{#2}\,}\,}
 \newcommand{\sr}[2]{\,\,\,\stackrel{{#1}}{{#2}}\,\,\,}
 \newcommand{\totald}[3][]{\frac{\mathrm{d}^{#1} #2}{\mathrm{d} #3^{#1}}}
 \newcommand{\verts}[1]{\left\vert\,{#1}\,\right\vert}$
\begin{align}
& \color{#44f}{\left.\rule{0pt}{5mm}\pars{a + x}^{n}
\,\right\vert_{\ \verts{x/a}\ <\ 1}}\,\,\, =\
a^{n}\pars{1 + {x \over a}}^{n} = a^{n}\sum_{k = 0}^{\color{red}{\large\infty}}
{\Gamma\pars{n + 1} \over \Gamma\pars{k + 1}\Gamma\pars{n - k + 1}}
\pars{x \over a}^{k}
\\[5mm] = & \
\bbx{\color{#44f}{\sum_{k = 0}^{\infty}
{\Gamma\pars{n + 1} \over \Gamma\pars{k + 1}\Gamma\pars{n - k + 1}}
\, a^{n - k}\,x^{k}}} \\ &
\end{align}
By the way, $\ds{{\Gamma\pars{n + 1} \over \Gamma\pars{k + 1}\Gamma\pars{n - k + 1}} = {n \choose k}}$: It's the generalized binomial expression. When $\ds{n \in \mathbb{N}_{\geq\ 0}}\,$, the factor $\ds{\Gamma\pars{n - k + 1}}$ truncates the sum at $\ds{n}$.
