PreprintCC BY 4.0arXiv
On concatenations of two k-generalized Pell numbers
Abstract
We study the concatenation of two k-generalized Pell numbers. More precisely, we determine all solutions of the equation Pn(k) = Pm(k) · 10d + Pp(k), where d is the number of decimal digits of Pp(k). We prove that for k ≥ 3 there are no solutions, while for k = 2 the only solution is P4 = 12 = 1|2.
Related
- Multiplicative independence in the sequence of k-generalized Pell numbers
- Pillai's equation between k-generalized Pell numbers and Tribonacci numbers
- On the Diophantine Equations Arising from Three-Term b-Concatenations in Pell-Type Sequences
- Tribonacci numbers that are palindromic concatenations of two distinct repdigits
- An Integral Representation of the Generalized Fibonacci Numbers
BibTeX
@misc{deme2026concatenations,
title = {{On concatenations of two $k$-generalized Pell numbers}},
author = {Cherif B. Deme and Kancou D. Fall and Khady Faye and Bernadette Faye},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2606.15290},
eprint = {2606.15290},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.15290},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - On concatenations of two k-generalized Pell numbers
AU - Cherif B. Deme
AU - Kancou D. Fall
AU - Khady Faye
AU - Bernadette Faye
PY - 2026
DA - 2026/10/11
PB - arXiv
DO - 10.48550/arxiv.2606.15290
UR - https://arxiv.org/abs/2606.15290
AB - We study the concatenation of two k-generalized Pell numbers. More precisely, we determine all solutions of the equation P_n^(k) = P_m^(k) · 10^d + P_p^(k), where d is the number of decimal digits of P_p^(k). We prove that for k ≥ 3 there are no solutions, while for k = 2 the only solution is P_4 = 12 = 1|2.
ER -