On the number of arithmetical operations for finding Fibonacci numbers (Q1123222)
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: On the number of arithmetical operations for finding Fibonacci numbers |
scientific article; zbMATH DE number 4108851
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of arithmetical operations for finding Fibonacci numbers |
scientific article; zbMATH DE number 4108851 |
Statements
On the number of arithmetical operations for finding Fibonacci numbers (English)
0 references
1989
0 references
The authors describe two simple algorithms of O(log N) to calculate the Fibonacci numbers \(F_ N\) and \(F_{N+1}\). These are based on well-known quadratic identities giving \(F_{2i}\), \(F_{2i+1}\), \(F_{2i+2}\) in terms of \(F_ i\) and \(F_{i+1}\). The algorithms are defined with 15 and 19 lines of pseudo code.
0 references
Lucas numbers
0 references
complexity
0 references
computational number theory
0 references
algorithms
0 references
Fibonacci numbers
0 references
0.9088152
0 references
0 references
0 references
0 references
