On second order linear sequences of composite numbers
Abstract
In this paper we present a new proof of the following 2010 result of Dubickas, Novikas, and Siurys: Let (a,b)∈ Z2 and let (xn)n 0 be the sequence defined by some initial values x0 and x1 and the second order linear recurrence equation* xn+1=axn+bxn-1 equation* for n 1. Suppose that b≠ 0 and (a,b)≠ (2,-1), (-2, -1). Then there exist two relatively prime positive integers x0, x1 such that |xn| is a composite integer for all n∈ N. The above theorem extends a result of Graham who solved the problem when (a,b)=(1,1).
0