Some Explicit Formulas for Sums Involving the Binomial Coefficients with the Falling Factorial
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.