On the Diophantine Equation Fn = x^a \pm x^b \pm 1 in Mersenne and Fermat Numbers

DOI10.5556/j.tkjm.53.2022.3973OpenAlexW3130053272MaRDI QIDQ5872495

No author found.

Publication date: 30 January 2023

Published in: Tamkang Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5556/j.tkjm.53.2022.3973

zbMATH Keywords

Fibonacci numbersexponential Diophantine equationslower bounds for linear forms in logarithmsMersenne and Fermat numbers

Mathematics Subject Classification ID

Counting solutions of Diophantine equations (11D45) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86)

Cites Work

• Pell and Pell-Lucas numbers of the form \(x^a\pm x^b+1\)
• Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
• 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 the logarithms of algebraic numbers. II
• Powers of two as sums of two k-Fibonacci numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Diophantine Equation Fn = x^a \pm x^b \pm 1 in Mersenne and Fermat Numbers