The Diophantine equation T_l = U_n - U_m

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)

Recommendations

• Tribonacci numbers that are products of two Fibonacci numbers
• On the Diophantine equation 𝑈_{𝑛}-𝑏^{𝑚}=𝑐
• Tribonacci numbers, \(S\)-units and Diophantine triples
• Solutions to a Pillai-type equation involving tribonacci numbers and \(S\)-units
• On Pillai's problem with tribonacci numbers and powers of 2

zbMATH Keywords

Baker's methodlinear form in logarithmsgeneralized Lucas numberstribonacci numbers

Mathematics Subject Classification ID

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 3x²−2 = y² AND 8x²−7 = z²
• 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)