History


Help on query formulation
A Fibonacci curiosity. (English)
Math. Spectr. 48, No. 1, 13-15 (2015).
Summary: Using recursion, we establish that the sums $\sum_{k\ge 0,k \text{even}}{m-k\choose k}$ and $\sum_{k\ge 0,k \text{odd}}{m-k\choose k}$, which occur in the well-known Lucas formula, are equal if and only if $m=3n-1$.
Classification: F60
Valid XHTML 1.0 Transitional Valid CSS!