On the equation (2ᵏ-1)(3l-1)=5ᵐ-1

zbMATH Open1472.11106MaRDI QIDQ3387008FDOQ3387008

Authors: Florian Luca, László Szalay 

Publication date: 12 January 2021

Full work available at URL: https://azjm.org/volumes/1002/pdf/1002-1.pdf

Recommendations

• On the diophantine equation \(1+x+y=z\)
• On the Diophantine equation \(F_n - F_m=2^a\)
• On the diophantine equation \((2^n-1)(3^n-1)=x^2\)
• On the Diophantine equation \(x^2+5^k17^l=y^n\)
• The Diophantine equation \((x^{k} - 1)(y^{k} - 1) = (z^{k} - 1)^{t}\)

zbMATH Keywords

exponential Diophantine equationlinear forms in logarithms

Mathematics Subject Classification ID

Exponential Diophantine equations (11D61) Computer solution of Diophantine equations (11Y50) Linear forms in logarithms; Baker's method (11J86)

Cites Work

• Number Theory
• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• Title not available (Why is that?)
• Fibonacci Numbers which are Products of two Pell Numbers

Cited In (2)

• Resolution of the equation \((3^{x_{1}}-1)(3^{x_{2}}-1)=(5^{y_{1}}-1)(5^{y_{2}}-1)\)
• A generalization of the equation (2 ^k − 1) (3 ^l − 1) = 5 ^m − 1

Uses Software

• Maple

This page was built for publication: On the equation \((2^k-1)(3^l-1)=5^m-1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387008)