The Diophantine equation T_l = U_n - U_m
From MaRDI portal
Publication:6629758
DOI10.1007/S13370-024-01214-4MaRDI QIDQ6629758FDOQ6629758
Authors: Pagdame Tiebekabe, K. R. Kakanou, Ismaïla Diouf
Publication date: 30 October 2024
Published in: Afrika Matematika (Search for Journal in Brave)
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Exponential Diophantine equations (11D61) Computer solution of Diophantine equations (11Y50) Linear forms in logarithms; Baker's method (11J86)
Cites Work
- My Numbers, My Friends
- 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
- Title not available (Why is that?)
- THE EQUATIONS 3x2−2 = y2 AND 8x2−7 = z2
- Pell-Lucas numbers as sum of same power of consecutive Pell numbers
- Fibonacci numbers as sums of two Padovan numbers
- On Fibonacci numbers as sum of powers of two consecutive tribonacci numbers
This page was built for publication: The Diophantine equation \(T_l = \mathcal{U}_n - \mathcal{U}_m\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629758)