On second-order linear sequences of composite numbers

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Abstract: In this paper we present a new proof of the following 2010 result of Dubickas, Novikas, and Siurys: Let

(a, b) i n m a t h b b Z^{2}

and let

(x_{n})_{n g e 0}

be the sequence defined by some initial values

x_{0}

and

x_{1}

and the second order linear recurrence �egin{equation*} x_{n+1}=ax_n+bx_{n-1} end{equation*} for

n g e 1

. Suppose that

b e q 0

and

(a, b) e q (2, - 1), (- 2, - 1)

. Then there exist two relatively prime positive integers

x_{0}

,

x_{1}

such that

| x_{n} |

is a composite integer for all

n i n m a t h b b N

. The above theorem extends a result of Graham who solved the problem when

(a, b) = (1, 1)

.

Recommendations

Cites work

Cited in

(8)

Describes a project that uses

Uses Software

This page was built for publication: On second-order linear sequences of composite numbers