An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers (Q2276093): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3792/pjaa.87.45 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975632637 / rank | |||
Normal rank | |||
Revision as of 20:41, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers |
scientific article |
Statements
An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers (English)
0 references
16 August 2011
0 references
The authors prove that there is no integer \(s\geq 3\) such that the sum of \(s\)-powers of two consecutive Fibonacci numbers is a Fibonacci number. The main tool of the proof is a lower bound for a linear form in three logarithms of algebraic numbers combined with the use of the Baker-Davenport Lemma.
0 references
Fibonacci numbers
0 references
applications of linear forms in logarithms
0 references
