Cullen numbers in sums of terms of recurrence sequence

Abstract

Let (Un)n≥ 0 be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer , let · 2 + 1 be a Cullen number. Recently in bmt, generalized Cullen numbers in terms of linear recurrence sequence (Un)n≥ 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] we consider the Diophantine equation Un1 + ·s + Unk = · x + Q(x), and prove effective finiteness result. Furthermore, we demonstrate our method by an example.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…