No label defined (Q4831372)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2123885
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2123885 |
Statements
29 December 2004
0 references
linear recurrence
0 references
0.8273067474365234
0 references
0.8273067474365234
0 references
0.8213194012641907
0 references
0.8161741495132446
0 references
0.814639151096344
0 references
Let a binary linear recurrence \(\{W_n\}\) be defined for \(n\geq 0\) by: \(W_0=a\), \(W_1=b\), \(W_n=pW_{n-1}+W_{n-2}\) for \(n\geq 2\) where \(a,b,p\) are arbitrary complex numbers such that \(p(p^2+2) (p^2 +4)\neq 0\). Let \(\Delta=p^2+4\). In particular, if \((a,b)=(0,1)\), let \(W_n =U_n\). Furthermore if \(p=1\), then \(W_n=F_n\) (the \(n\)th Fibonacci number). The author presents a total of 29 summation formulas, including: \[ \sum^{4j}_{n=4i+1}(-1)^{n(n+1)2}W_{2n}= \frac {\Delta} {\Delta-2}U_{4j-4i} W_{4j+4i+1}. \] The proofs are by induction.
0 references