Using Lucas sequences to generalize a theorem of Sierpiński

Abstract: In 1960, Sierpi'nski proved that there exist infinitely many odd positive integers

k

such that

k c d o t 2^{n} + 1

is composite for all positive integers

n

. In this paper, we prove some generalizations of Sierpi'nski's theorem with

2^{n}

replaced by expressions involving certain Lucas sequences

. In particular, we show the existence of infinitely many Lucas pairs

, for which there exist infinitely many positive integers

k

, such that

is composite for all integers

n g e 1

. Sierpi'nski's theorem is the special case of

a l p h a = 2

and

. Finally, we establish a nonlinear version of this result by showing that there exist infinitely many rational integers

a l p h a > 1

, for which there exist infinitely many positive integers

k

, such that

k^{2} (U_{n} (a l p h a, 1) + (a l p h a - 1)^{2}) + 1

is composite for all integers

n g e 1

.

Recommendations

Cited in

(4)

This page was built for publication: Using Lucas sequences to generalize a theorem of Sierpiński