I read that the $n$-th finite difference of the sequence
$1^n, 2^n, 3^n,\dots$
is $n!$, but I'm not able to prove this. Could someone give an idea of why this is true?
I read that the $n$-th finite difference of the sequence
$1^n, 2^n, 3^n,\dots$
is $n!$, but I'm not able to prove this. Could someone give an idea of why this is true?
The difference operator $\delta$ that maps a polynomial $p(x)$ into $(\delta p)(x)=p(x+1)-p(x)$ has the following properties:
If follows that if $p(x)=x^n$ or $(x+1)^n$, $\delta^n p$ is a polynomial with degree zero (i.e. a constant) and leading term $n\cdot(n-1)\cdot\ldots\cdot 1 = \color{red}{n!}$.
An alternative proof. We want to show that: $$ \sum_{k=0}^{n}\binom{n}{k}(-1)^{n-k} k^n = n!. $$ $k^n$ is the number of functions from $\{1,2,\ldots,n\}$ to $\{1,2,\ldots,k\}$, hence the LHS accounts for the functions $f:\{1,2,\ldots,n\}\to \{1,2,\ldots,n\}$ such that $|\text{Im}\,f|=n$, i.e. the surjective functions, that clearly are $\color{red}{n!}$.
A third alternative. Let: $$ A(n) = \sum_{k=0}^{n}\binom{n}{k}(-1)^{n-k} k^n. $$ Since $k\binom{n}{k} = n\binom{n-1}{k-1}$, we have: $$ A(n) = n\sum_{k=1}^{n}\binom{n-1}{k-1}(-1)^{n-k} k^{n-1} = n\sum_{k=0}^{n-1}\binom{n-1}{k}(-1)^{n-1-k} k^{n-1} = n\cdot A(n-1).$$ Since $A(1)=1$, $A(n)=\color{red}{n!}$ follows by induction.