Generalized Cullen numbers in linear recurrence sequences

Abstract: A Cullen number is a number of the form

m 2^{m} + 1

, where

m

is a positive integer. In 2004, Luca and Stu anicu a proved, among other things, that the largest Fibonacci number in the Cullen sequence is

F_{4} = 3

. Actually, they searched for generalized Cullen numbers among some binary recurrence sequences. In this paper, we will work on higher order recurrence sequences. For a given linear recurrence

(G_{n})_{n}

, under weak assumptions, and a given polynomial

T (x) i n m a t h b b Z [x]

, we shall prove that if

G_{n} = m x^{m} + T (x)

, then [ mlllog log |x|log^2(log log |x|) mbox{and} nlllog |x|loglog |x|log^2(log log |x|), ] where the implied constant depends only on

(G_{n})_{n}

and

T (x)

.

Review text

Generalized Cullen numbers, are numbers written on the form \(C_{m,s}=ms^m+1\). In this paper, inspired by previous works, the authors investigate the existence of generalized Cullen numbers on linear recurrence sequences. More generally, given a linear recurrence sequence \(\{G_n\}\), \(a\in\mathbb{Z}\) and a polynomial with integer coefficients \(T(x)\), they study the solutions of the Diophantine equation \(G_n=ax^m+T(x)\) (note that if \(T(x)=1\), this implies finding generalized Cullen numbers among the elements of the sequence). The main result of the paper states that under certain assumptions over the roots of the characteristic polynomial of the sequence, there exist effectively computable constants \(C_1\) and \(C_2\) such that if \((m,n,x)\) is a solution of the equation, then \(m\leq C_1\) and \(n\leq C_2\log |x|\). Then, they proceed to compute \(C_1\) and \(C_2\) in the case of Cullen numbers (\(m=n\), \(s=2\), \(T(x)=1\)) and \(G_n\) the sequence of the so-called \(k\)-Fibonacci numbers recursively defined by \(F^{(k)}_n=\sum_{i=1}^kF^{(k)}_{n-i}\).

Recommendations

Cites work

Cited in

(10)

Describes a project that uses

Uses Software

OEIS

This page was built for publication: Generalized Cullen numbers in linear recurrence sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2420396)