On the sum of powers of two consecutive Fibonacci numbers (Q632997)
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 sum of powers of two consecutive Fibonacci numbers |
scientific article; zbMATH DE number 5871107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the sum of powers of two consecutive Fibonacci numbers |
scientific article; zbMATH DE number 5871107 |
Statements
On the sum of powers of two consecutive Fibonacci numbers (English)
0 references
29 March 2011
0 references
Let \(F_n\) be the Fibonacci numbers, \(s\) a positive integer. The authors prove that if \(F_n^s+F_{n+1}^s \) is a Fibonacci number for all suficiently large \(n\), then \(s=1\) or \(2\).
0 references
Fibonacci numbers
0 references
0 references
0.8683361411094666
0 references
0.8366785049438477
0 references
0.8303236961364746
0 references
0.8193843364715576
0 references
0.8172606825828552
0 references
