On a variant of Pillai's problem with factorials and \(S\)-units
From MaRDI portal
Publication:6122740
DOI10.1007/s11139-023-00787-1OpenAlexW4387902958MaRDI QIDQ6122740
Bernadette Faye, Florian Luca, Volker Ziegler
Publication date: 1 March 2024
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11139-023-00787-1
Computer solution of Diophantine equations (11Y50) Counting solutions of Diophantine equations (11D45) Exponential Diophantine equations (11D61)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving exponential diophantine equations using lattice basis reduction algorithms
- Romanov type problems
- 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
- On a problem of Pillai with Fibonacci numbers and powers of 3
- Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
- On a problem of Pillai with Fibonacci numbers and powers of 2
- An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
- Logarithmic forms and group varieties.
- On the problem of Pillai with k-generalized Fibonacci numbers and powers of 3
- p-adic logarithmic forms and group varieties II
- Primary cyclotomic units and a proof of Catalans conjecture
- On a variant of Pillai’s problem
- ON PILLAI'S PROBLEM WITH TRIBONACCI NUMBERS AND POWERS OF 2
- The equation 2^{𝑥}-3^{𝑦}=𝑑
- Linear combinations of factorial and \(S\)-unit in a ternary recurrence sequence with a double root
This page was built for publication: On a variant of Pillai's problem with factorials and \(S\)-units