Abstract
Let (Tn)n≥0 be the sequence of Tribonacci numbers defined by T= 0 , T 1= T 2= 1 , and T n + 3= T n + 2+ T n + 1+ T n for all n≥ 0. In this note, we use of lower bounds for linear forms in logarithms of algebraic numbers and the Baker-Davenport reduction procedure to find all Tribonacci numbers that are concatenations of two repdigits.
Original language | English |
---|---|
Article number | 203 |
Number of pages | 10 |
Journal | Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales / Serie A, Matematicas |
Volume | 114 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1 Oct 2020 |
Keywords
- Tribonacci numbers
- Repdigits
- Linear forms in logarithms
- Reduction method
ASJC Scopus subject areas
- Algebra and Number Theory
Fields of Expertise
- Information, Communication & Computing