\(k\)-Pell numbers as product of two repdigits (Q2113567): Difference between revisions

The paper deals with the investigation of generalized Pell numbers of order \(k\), which are products of two repdigits. Since last two-three decades, there has been a lot of studies that involves the search of repdigits either in a particular sequence or the sums or products of sequential terms. Some times the sequential terms belong to one particular sequence and some times not. Almost in a balanced race the search of sequential terms from any particular sequence either as sums, differences or products of repdigits has been done. These Diophantine problems are concerned with simple binary recurrences and recurrences of any higher order as well. The present work is mostly a generalization to one of the recent investigation, where the repdigits in generalized \(k\)-Pell numbers have been determined and also serves as an extension to some of the works involving repdigits and generalized Fibonacci and Lucas sequences. The method of proof is based on the usual techniques of getting reduced bound on some variables using continued fractions and Diophantine approximations by defining linear forms in logarithms.