Sums of Fibonacci numbers that are perfect powers

DOI10.2989/16073606.2022.2109220zbMath1529.11061arXiv2103.14487OpenAlexW3146069697MaRDI QIDQ6170156

Volker Ziegler

Publication date: 15 August 2023

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.14487

zbMATH Keywords

Fibonacci numbersBaker's methodDiophantine equations

Mathematics Subject Classification ID

Computer solution of Diophantine equations (11Y50) Counting solutions of Diophantine equations (11D45) Exponential Diophantine equations (11D61) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving exponential diophantine equations using lattice basis reduction algorithms
• Fibonacci numbers at most one away from a perfect power
• On perfect powers that are sums of two Fibonacci numbers
• On the nonnegative integer solutions to the equation \(F_n \pm F_m = y^a\)
• An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
• An Extension of the Theorem on Primitive Divisors in Algebraic Number Fields
• Linear forms in two logarithms and interpolation determinants II
• Primitive divisors of the expression An - Bn in algebraic number fields.
• On The diophantine equationFn+F_m=2^a
• THE EQUATIONS 3x²−2 = y² AND 8x²−7 = z²

This page was built for publication: Sums of Fibonacci numbers that are perfect powers