In this problem we are going to establish the binomial series
$$ (1 + x)^{\alpha} = \sum_{k=0}^\infty \binom{\alpha}{k}x^k$$, $|x| \leq 1$, for any $\alpha$, by showing that $$\lim_{n\to \infty}{R_{n,0}(x)} = 0. $$ The proof involves several steps, and it uses the Cauchy form for the remainder, and the Lagrange forms for the reminder.
a) Use the quotient rule to show that the series converges for $|r| \leq 1$.
Ok, so what I did was, $$ \frac{a_{k+1}}{a_k} = \frac{\binom{\alpha}{k+1}r^{k+1}}{\binom{\alpha}{k}r^k} = \frac{r^{k+1}\frac{\alpha!}{(k+1)!(\alpha - k -1)!}}{r^k \frac{\alpha !}{k! (\alpha - k)!}} = r \frac {k! (\alpha - k)! \alpha!}{(k+1)! (\alpha -k -1)! \alpha!}= \frac{r(\alpha - k)}{k+1}. $$
By the quotient rule, $ \frac{r(\alpha - k)}{k+1}$ should be less than $1$, so that
$$\sum_{k=0}^\infty \binom{\alpha}{k}r^k$$ converges. An that is why I stated the problem:
If $|r| \leq 1 $, show that $$ \frac{r(\alpha - k)}{k+1} \leq 1 $$
where $\alpha \in \Bbb{R}, k \in \Bbb{N}$ , which is false...
This isn't true in all cases. Take $\alpha = 10$ and $k = 1$. You'll get $r\cdot \frac{9}{2} \leq 1$ which is not true for all $r$ for which $|r| \leq 1$. Are we missing information?