With m being some arbitrary positive natural number constant and n being a positive natural number variable, can the summation of;
∑[k=0, n-1] (n - k)^m (-1)^k n! / ( k! (n - k)! )
be simplified to a NONE summation by it being factorized?
The reason why I think there just might be a way is because I see contained in there, more specifically the "(-1)^k n! / ( k! (n - k)! ) " part, binomial coefficients, which implies to me it just might be a way to simplify it by factorizing it.
I tried to see if I could factorize it but so far I just cannot get past the " (n - k)^m " component of the summation for that because that part to me seems to me to 'get in the way' of factorization.
∑[k=0, n-1] (n - k)^m (-1)^k n! / ( k! (n - k)! )
be simplified to a NONE summation by it being factorized?
The reason why I think there just might be a way is because I see contained in there, more specifically the "(-1)^k n! / ( k! (n - k)! ) " part, binomial coefficients, which implies to me it just might be a way to simplify it by factorizing it.
I tried to see if I could factorize it but so far I just cannot get past the " (n - k)^m " component of the summation for that because that part to me seems to me to 'get in the way' of factorization.