Padovan numbers that are concatenations of two distinct repdigits (Q2054620): Difference between revisions

The sequence of Padovan numbers \((P_n)_{n\ge 0}\) is given by the recurrence \(P_{n+3}=P_{n+1}+P_n\) for \(n\ge 0\) with initial terms \(P_0=0,~P_1=P_2=1\). In the paper under review the author determines all the Padovan numbers which are a concatenation of two repdigits, that is of the form \({\overline{{\underbrace{d_1\cdots d_1}_{j_1~{\text{times}}}\underbrace{d_2\cdots d_2}_{j_2~{\text{times}}}}}}\), where \(j_1\ge 1,~j_2\ge 1\) and \(d_1,~d_2\) are distinct digits in \(\{0,1\ldots,9\}\) (with \(d_1>0\)). The largest such is \(P_{21}=200\). The proof uses lower bounds for linear forms in logarithms of algebraic numbers and computations with continued fractions.