Some Explicit Formulas for Sums Involving the Binomial Coefficients with the Falling Factorial

11 May 2016  ·  Akkus Ilker ·

Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial...

PDF Abstract
No code implementations yet. Submit your code now

Categories


Combinatorics