On a variant of Pillai’s problem with binary recurrences and S-units

DOI10.1142/s1793042123500720zbMath1529.11060OpenAlexW4321015048MaRDI QIDQ6110499

Volker Ziegler

Publication date: 1 August 2023

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793042123500720

zbMATH Keywords

exponential Diophantine equationsDiophantine equationsPillai's problem\(S\)-units

Mathematics Subject Classification ID

Computer solution of Diophantine equations (11Y50) Recurrences (11B37) Counting solutions of Diophantine equations (11D45) Exponential Diophantine equations (11D61)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On divisors of Lucas and Lehmer numbers
• Solving exponential diophantine equations using lattice basis reduction algorithms
• Effective lower bound for the \(p\)-adic distance between powers of algebraic numbers
• On a variant of Pillai's problem. II.
• Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
• On a variant of Pillai's problem involving \(S\)-units and Fibonacci numbers
• On a problem of Pillai with Fibonacci numbers and powers of 2
• Existence of primitive divisors of Lucas and Lehmer numbers
• An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
• Lecture Notes on Diophantine Analysis
• Products of Prime Powers in Binary Recurrence Sequences Part I: The Hyperbolic Case, with an Application to the Generalized Ramanujan-Nagell Equation
• Primary cyclotomic units and a proof of Catalans conjecture

This page was built for publication: On a variant of Pillai’s problem with binary recurrences and S-units