On Repdigits as Sums of Fibonacci and Tribonacci Numbers

In this paper, we use Baker's theory for nonzero linear forms in logarithms of algebraic numbers and a Baker-Davenport reduction procedure to find all repdigits (i.e., numbers with only one distinct digit in its decimal expansion, thus they can be seen as the easiest case of palindromic numbers, which are a "symmetrical" type of numbers) that can be written in the form F-n+T-n, for some n >= 1, where (F-n)(n >= 0) and (T-n)(n >= 0) are the sequences of Fibonacci and Tribonacci numbers, respectively.