The tutor of my algorithms class used the following equation today:
$\sum\limits^\infty_{n=0} \sum\limits^n_{k=0} \frac {b^k} {k!} \cdot \frac {a^{n-k}} {(n-k)!}$ = $\sum\limits^\infty_{n=0} \frac {{(a+b)}^n} {n!}$
When I asked him why we are allowed to use this he just told me that you usually prove it in one of your first maths lectures. However, I am still too stupid to see why this should be true. A hint would be really nice.
I don't know if that is misleading but after having some thoughts about the equation I figured that the part $\sum\limits^n_{k=0} \frac {b^k} {k!} \cdot \frac {a^{n-k}} {(n-k)!}$ is a Cauchy-Product. After finding that out I wrote the first terms of the sum on a piece of paper and always saw that they look pretty similar to the binomial theorem. But I can't find a way to do it for an infinite amount of terms. Just for the given ones I wrote down.