2000 character limit reached
On Mixed Concatenations of Pell and Pell-Lucas Numbers which are Pell Numbers
Published 23 Apr 2023 in math.NT | (2304.11607v2)
Abstract: Let $(P_n){n\ge 0}$ and $(Q_n ){n\ge 0}$ be the Pell and Pell-Lucas sequences. Let $b$ be a positive integer such that $b\ge 2.$ In this paper, we prove that the following two Diophantine equations $P_{n}=b{d}P_{m}+Q_{k}$ and $P_{n}=b{d}Q_{m}+P_{k}$ with $d,$ the number of digits of $P_k$ or $Q_k$ in base $b,$ have only finitely many solutions in nonegative integers $(m, n, k, b, d)$. Also, we explicitly determine these solutions in cases $2 \le b \le 10.$
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.