An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers (Q2276093): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fibonacci numbers at most one away from a perfect power / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4215652 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the sum of powers of two consecutive Fibonacci numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II / rank | |||
Normal rank |
Revision as of 08:59, 4 July 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
0 references