Abstract
In this paper, all base 10 repdigits expressible as sums of three Pell numbers are found.
Similar content being viewed by others
References
F. Luca, Repdigits as sums of three Fibonacci numbers. Math. Commun. 17, 1–11 (2012)
Y. Bugeaud, M. Mignotte, S. Siksek, Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers. Ann. Math. (2) 163, 969–1018 (2006)
E.M. Matveev, An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II. Izv. Ross. Akad. Nauk Ser. Mat. 64(2000), 125–180 [English transl. in Izv. Math. 64 (2000), 1217–1269]
A. Dujella, A. Pethő, A generalization of a theorem of Baker and Davenport. Q. J. Math. Oxf. Ser. (2) 49, 291–306 (1998)
B.M.M. de Weger, Algorithms for Diophantine Equations (Stichting Mathematisch Centrum, Amsterdam, 1989)
Acknowledgements
The authors thank the referee for a careful reading of the manuscript and for comments which improved its quality. F. L. was supported in part by Grant CPRR160325161141 and an A-rated scientist award both from the NRF of South Africa and by Grant No. 17-02804S of the Czech Granting Agency. This paper was started during a visit of A.T. at the School of Mathematics of Wits University in August, 2017. This author thanks this institution for its hospitality and the CoEMaSS at Wits for support.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Normenyo, B.V., Luca, F. & Togbé, A. Repdigits as sums of three Pell numbers. Period Math Hung 77, 318–328 (2018). https://doi.org/10.1007/s10998-018-0247-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10998-018-0247-y