Solutions to a Pillai-type equation involving tribonacci numbers and S-units

DOI10.1007/S00009-024-02702-4MaRDI QIDQ6591069zbMATH OpenFDO

Authors Herbert Batte, Florian Luca

Publication date 21 August 2024

Published in Mediterranean Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(p\)-adic numberslinear forms in logarithmsPillai's problem\(S\)-unitstribonacci numbers

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7114878
• On Pillai's problem with tribonacci numbers and powers of 2
• Tribonacci numbers, \(S\)-units and Diophantine triples
• Tribonacci numbers close to the sum \(2^a+3^b+5^c\)
• On a variant of Pillai's problem involving \(S\)-units and Fibonacci numbers

Cites work

• scientific article; zbMATH DE number 1200746 (Why is no real title available?)
• scientific article; zbMATH DE number 3252432 (Why is no real title available?)
• scientific article; zbMATH DE number 3023009 (Why is no real title available?)
• A simplified Binet formula for \(k\)-generalized Fibonacci numbers
• An effective lower bound for the height of algebraic numbers
• An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
• An inequality for the discriminant of a polynomial
• Binary polynomial power sums vanishing at roots of unity
• Effective lower bound for the \(p\)-adic distance between powers of algebraic numbers
• Factoring polynomials with rational coefficients
• Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
• Logarithmic forms and group varieties.
• On Pillai's problem with tribonacci numbers and powers of 2
• On a problem of Pillai with Fibonacci numbers and powers of 2
• On a variant of Pillai's problem involving \(S\)-units and Fibonacci numbers
• On a variant of Pillai's problem. II.
• On a variant of Pillai’s problem with binary recurrences and S-units
• On the largest prime factor of the \(k\)-Fibonacci numbers
• On the multiplicity in Pillai's problem with Fibonacci numbers and powers of a fixed prime
• On the problem of Pillai with k-generalized Fibonacci numbers and powers of 3
• Problems in Algebraic Number Theory
• Products of Prime Powers in Binary Recurrence Sequences Part I: The Hyperbolic Case, with an Application to the Generalized Ramanujan-Nagell Equation
• Solving exponential diophantine equations using lattice basis reduction algorithms

Cited in

(1)

• The Diophantine equation \(T_l = \mathcal{U}_n - \mathcal{U}_m\)

This page was built for publication: Solutions to a Pillai-type equation involving tribonacci numbers and \(S\)-units

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591069)