On the problem of Pillai with k-generalized Fibonacci numbers and powers of 3
From MaRDI portal
Publication:3303493
DOI10.1142/S1793042120500876zbMath1446.11025arXiv1905.01015OpenAlexW3102603879WikidataQ114071947 ScholiaQ114071947MaRDI QIDQ3303493
Florian Luca, Mahadi Ddamulira
Publication date: 11 August 2020
Published in: International Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.01015
Counting solutions of Diophantine equations (11D45) Exponential Diophantine equations (11D61) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86)
Related Items (8)
On a variant of Pillai problem: integers as difference between generalized Pell numbers and perfect powers ⋮ On a variant of Pillai's problem involving \(S\)-units and Fibonacci numbers ⋮ On a variant of Pillai's problem with factorials and \(S\)-units ⋮ On the Diophantine equation 𝑈_{𝑛}-𝑏^{𝑚}=𝑐 ⋮ On Pillai’s problem with X-coordinates of Pell equations and powers of 2 II ⋮ k-generalized Fibonacci numbers which are concatenations of two repdigits ⋮ Unnamed Item ⋮ On the problem of Pillai with Pell numbers, Pell–Lucas numbers and powers of 3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a variant of Pillai's problem. II.
- On a problem of Pillai with \(k\)-generalized Fibonacci numbers and powers of 2
- On Pillai's problem with the Fibonacci and Pell sequences
- Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
- On a problem of Pillai with Fibonacci numbers and powers of 2
- 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
- On a conjecture about repdigits in k-generalized Fibonacci sequences
- Primary cyclotomic units and a proof of Catalans conjecture
- On a variant of Pillai’s problem
- On the distance between generalized Fibonacci numbers
- ON PILLAI'S PROBLEM WITH TRIBONACCI NUMBERS AND POWERS OF 2
- A simplified Binet formula for k-generalized Fibonacci numbers
- THE EQUATIONS 3x2−2 = y2 AND 8x2−7 = z2
- The equation 2^{𝑥}-3^{𝑦}=𝑑
This page was built for publication: On the problem of Pillai with k-generalized Fibonacci numbers and powers of 3