On a variant of Pillai's problem involving \(S\)-units and Fibonacci numbers
From MaRDI portal
Publication:2161101
DOI10.1007/s40590-022-00450-7zbMath1502.11040OpenAlexW4285592712WikidataQ117384923 ScholiaQ117384923MaRDI QIDQ2161101
Publication date: 4 August 2022
Published in: Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40590-022-00450-7
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)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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.
- On a problem of Pillai with \(k\)-generalized Fibonacci numbers and powers of 2
- Linear equations in variables which lie in a multiplicative group
- On Pillai's problem with the Fibonacci and Pell sequences
- 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
- On the problem of Pillai with k-generalized Fibonacci numbers and powers of 3
- Linear forms in two logarithms and interpolation determinants II
- Products of Prime Powers in Binary Recurrence Sequences Part I: The Hyperbolic Case, with an Application to the Generalized Ramanujan-Nagell Equation
- On a variant of Pillai’s problem
- On the problem of Pillai with Padovan numbers and powers of 3
- ON PILLAI'S PROBLEM WITH TRIBONACCI NUMBERS AND POWERS OF 2
- On sums of Fibonacci numbers with few binary digits
