On the Diophantine equation F_n-2ᵐ +F_n^m +F_n+2ᵐ =y^p
From MaRDI portal
Publication:7034199
The paper under review concerns the Diophantine equation \N\[\NF_{n-d}^m+F_n^m+F_{n+d}^m=y^p \N\]\Nwhere \(F_k\) denotes the \(k\)th Fibonacci number and \(m\), \(n\), \(d\), \(y\), and \(p\) are all positive integers with \(n\geq d\) and \(p\) prime. The authors prove that this equation has no solution in integers unless \(3\mid d\) or \(m\) is odd.\N\NThey also investigate the case \(d=2\) more carefully, and completely classify integer solutions when \(m\) is either \(1\) or a prime of the form \(4k+3\).
Cites work
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Fibonacci numbers at most one away from a perfect power
- scientific article; zbMATH DE number 4210225 (Why is no real title available?)
- On Fibonacci numbers of the form q^ky^k.
- On perfect powers that are sums of two Fibonacci numbers
- PERFECT POWERS THAT ARE SUMS OF TWO POWERS OF FIBONACCI NUMBERS
- Primary cyclotomic units and a proof of Catalans conjecture
This page was built for publication: On the Diophantine equation \(F_{n-2}^m +F_n^m +F_{n+2}^m =y^p\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034199)
