Recurrence Relation for Sequence of mth Powers of Fibonacci Numbers

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $m \in \Z_{>0}$ be a (strictly) positive integer.


Then:

$\ds \sum_{k \mathop \in \Z} \dbinom m k_\FF \paren {-1}^{\ceiling {\paren {m - k} / 2} } {F_{n + k} }^{m - 1} = 0$

where:

$\dbinom m k_\FF$ denotes a Fibonomial coefficient
$F_{n + k}$ denotes the $n + k$th Fibonacci number
$\ceiling {\, \cdot \,}$ denotes the ceiling function


Proof

Lemma 1

$\ds \sum_{k \mathop \in \Z} \dbinom m k_\FF \paren {-1}^{\ceiling {\paren {m - k} / 2} } {F_{n + k} }^{m - 2} F_k = F_m \sum_{k \mathop \in \Z} \dbinom {m - 1} {k - 1}_\FF \paren {-1}^{\ceiling {\paren {m - k} / 2} } {F_{n + k} }^{m - 2} = 0$


Lemma 2

$\ds \sum_{k \mathop \in \Z} \dbinom m k_\FF \paren {-1}^{\ceiling {\paren {m - k} / 2} } {F_{n + k} }^{m - 2} \paren {-1}^k F_{m - k} = \paren {-1}^m F_m \sum_{k \mathop \in \Z} \dbinom {m - 1} k_\FF \paren {-1}^{\ceiling {\paren {m - 1 - k} / 2} } {F_{n + k} }^{m - 2} = 0$



This theorem requires a proof.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.


Examples

Example: $m = 3$

${F_n}^n - 2 {F_{n + 1} }^2 - 2 {F_{n + 2} }^2 + {F_{n + 3} }^2 = 0$


Historical Note

Donald E. Knuth, in his The Art of Computer Programming: Volume 1: Fundamental Algorithms, 3rd ed. of $1997$, attributes this result to Dov Jarden and Theodore Samuel Motzkin.

However, he provides a citation for Jarden's work only, and it is unclear from where Motzkin's contribution is sourced.


Sources

Retrieved from "https://proofwiki.org/w/index.php?title=Recurrence_Relation_for_Sequence_of_mth_Powers_of_Fibonacci_Numbers&oldid=514379"