Some Explicit Formulas for Sums Involving the Binomial Coefficients with the Falling Factorial
Combinatorics
2016-05-12 v2
Abstract
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.
Cite
@article{arxiv.1605.03108,
title = {Some Explicit Formulas for Sums Involving the Binomial Coefficients with the Falling Factorial},
author = {Ilker Akkus},
journal= {arXiv preprint arXiv:1605.03108},
year = {2016}
}
Comments
This paper has been withdrawn by the author due to technical problems in Theorem 2.1