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

DOI10.1007/S00009-024-02702-4MaRDI QIDQ6591069FDOQ6591069

Authors: Herbert Batte, Florian Luca 

Publication date: 21 August 2024

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

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

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)

Cites Work

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

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)