English

Cullen numbers in sums of terms of recurrence sequence

Number Theory 2020-10-21 v1

Abstract

Let (Un)n0(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 2+1\ell \cdot 2^{\ell} + 1 be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in terms of linear recurrence sequence (Un)n0(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)Z[x]Q(x) \in \mathbb{Z}[x] we consider the Diophantine equation Un1++Unk=x+Q(x)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.

Keywords

Cite

@article{arxiv.2010.10014,
  title  = {Cullen numbers in sums of terms of recurrence sequence},
  author = {Nabin Kumar Meher and Sudhansu Sekhar Rout},
  journal= {arXiv preprint arXiv:2010.10014},
  year   = {2020}
}

Comments

Any comments are welcome