2000 character limit reached
Cullen numbers in sums of terms of recurrence sequence (2010.10014v1)
Published 20 Oct 2020 in math.NT
Abstract: Let $(U_n){n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in terms of linear recurrence sequence $(U_n){n\geq 0}$ under certain weak assumptions has been studied. However, there is an error in their proof. In this paper, we generalize their work, as well as our result fixes their error. In particular, for a given polynomial $Q(x) \in \mathbb{Z}[x]$ we consider the Diophantine equation $U_{n_1} + \cdots + U_{n_k} = \ell \cdot x{\ell} + Q(x)$, and prove effective finiteness result. Furthermore, we demonstrate our method by an example.