Nested Summations
summary
This work claims explicit formulas that express Fibonacci, Lucas, Jacobstahl and Jacobstahl‑Lucas sequences as finitely nested finite sums, gives the construction that generalizes to Jacobstahl sequences with arbitrary core multiplicative factor, and machine‑checks the proofs in the Coq Proof Assistant with artifacts on Zenodo. Examples include nesting n sums to get (x+1)^n, nesting with decreasing bounds to get x! and a specific choice of inner bound (1−i) that yields Fibonacci numbers; proofs are formal and executable.
AI-written summary · about
chapters (12)
- 0:00Nested summations intro
- 1:53Single summations basics
- 2:35Two-loop nested sums
- 5:09Generalizing to three+ sums
- 6:58Arbitrary nesting depth
- 8:49Decreasing bounds & factorials
- 10:14Binomial coefficients via sums
- 12:25Catalan numbers from sums
- 13:09Fibonacci numbers from sums
- 14:23Moser’s theorem & DP origins
- 15:30Lucas & Jacobsthal numbers
- 16:14Summary
