Nonnegative integer solutions of the equationFn
From MaRDI portal
Publication:5229829
DOI10.3906/MAT-1810-83zbMATH Open1455.11054OpenAlexW2947388575WikidataQ127761240 ScholiaQ127761240MaRDI QIDQ5229829FDOQ5229829
Publication date: 19 August 2019
Published in: Turkish Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-1810-83
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)
Cites Work
- Title not available (Why is that?)
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- THE EQUATIONS 3x2−2 = y2 AND 8x2−7 = z2
- Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
- Powers of two as sums of two Lucas numbers
- Linear combinations of prime powers in binary recurrence sequences
- On The diophantine equationFn+Fm=2a
- Powers of two as sums of three Fibonacci numbers
- On perfect powers that are sums of two Fibonacci numbers
- A short history of the Fibonacci and golden numbers with their applications
- On the Diophantine equation $F_{n}-F_{m}=2^{a}$
- On Diophantine equations involving sums of Fibonacci numbers and powers of $2$
Cited In (5)
- On the nonnegative integer solutions of the equation Fn ± Fm = ya
- Mersenne numbers as a difference of two Lucas numbers
- On solutions of the Diophantine equation \(F_n-F_m=3^a\)
- On the nonnegative integer solutions to the equation \(F_n \pm F_m = y^a\)
- ON SOLUTIONS OF THE DIOPHANTINE EQUATION Fn1 + Fn2 + Fn3 + Fn4 = 2^a
This page was built for publication: Nonnegative integer solutions of the equationFn
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5229829)
