An algorithm for proving arbitrary identities involving linear recurrence sequences (Q2883413)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for proving arbitrary identities involving linear recurrence sequences |
scientific article; zbMATH DE number 6032420
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for proving arbitrary identities involving linear recurrence sequences |
scientific article; zbMATH DE number 6032420 |
Statements
10 May 2012
0 references
0.8948269
0 references
0.89282465
0 references
0.88957477
0 references
0.88242793
0 references
0.88147086
0 references
An algorithm for proving arbitrary identities involving linear recurrence sequences (English)
0 references
An algorithm for proving of identities involving linear recurrence sequences is introduced and illustrated with six examples, related to Fibonacci numbers.
0 references
