Abstract
Let \(k\ge 2\). A generalization of the well-known Pell sequence is the k-Pell sequence. For this sequence the first k terms are \(0,\ldots ,0,1\) and each term afterwards is given by the linear recurrence
In this paper, our main objective is to find all k-Pell numbers which are sum of two repdigits. This generalizes a result of Adegbindin et al. (Bull Malays Math Sci Soc 43:1253–1271, 2020) regarding Pell numbers with the above property.
Similar content being viewed by others
Change history
17 January 2022
A Correction to this paper has been published: https://doi.org/10.1007/s13398-021-01203-3
References
Faye, B., Luca, F.: Pell and Pell-Lucas numbers with only one distinct digits. Ann. Math. 45, 55–60 (2015)
Normenyo, B., Luca, F., Togbé, A.: Repdigits as sums of three Pell numbers. Period. Math. Hung. 77(2), 318–328 (2018)
Normenyo, B., Luca, F., Togbé, A.: Repdigits as sums of four Pell numbers. Bol. Soc. Mat. Mex. 25, 249–266 (2019)
Adegbindin, C., Luca, F., Togbé, A.: Pell and Pell-Lucas numbers as sums of two repdigits. Bull. Malays. Math. Sci. Soc. 43, 1253–1271 (2020)
Bravo, J.J., Herrera, J.L., Luca, F.: On a generalization of the Pell sequence. Math. Bohema. 146(2), 199–213 (2021)
Kiliç, E.: On the usual Fibonacci and generalized order-\(k\) Pell numbers. ARS Combin. 109, 391–403 (2013)
Kiliç, E.: The Binet formula, sums and representations of generalized Fibonacci \(p\)-numbers. Eur. J. Combin. 29, 701–711 (2008)
Kiliç, E., Taćsci, D.: The generalized Binet formula, representation and sums of the generalized order-\(k\) Pell numbers. Taiwan. J. Math. 10(6), 1661–1670 (2006)
Bravo, J.J., Herrera, J.L.: Repdigits in generalized Pell sequences. Arch. Math. 56(4), 249–262 (2020)
Alvarado, S.D., Luca, F.: Fibonacci numbers which are sums of two repdigits. In: Proceedings of the XIVth International Conference on Fibonacci numbers and their applications, Sociedad Matemática Mexicana, Aportaciones Matemáticas, Investigación, vol. 20, pp. 97–108 (2011)
Matveev, E.M.: An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers, II. Izv. Math. 64(6), 1217–1269 (2000)
Bugeaud, Y., Mignotte, M., Siksek, S.: Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas powers. Ann. Math. 163(2), 969–1018 (2006)
de Weger, B.M.M.: Algorithms for Diophantine equations. Eindhoven University of Technology, Eindhoven, Ph.D. (1989)
Bravo, J.J., Herrera, J.L., Luca, F.: Common values of generalized Fibonacci and Pell sequences. J. Number Theory 226, 51–71 (2021)
Adegbindin, C., Luca, F., Togbé, A.: Pell and Pell–Lucas numbers as sums of three repdigits. Acta Math. Univ. Comen. 90(1), 7–25 (2021)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Meguedmi, D., Rihane, S.E. & Togbé, A. Generalization of a theorem of Adegbindin, Luca and Togbé. RACSAM 116, 36 (2022). https://doi.org/10.1007/s13398-021-01177-2
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13398-021-01177-2