Showing a limited preview of this publication:
Abstract
A Sierpiński number is a positive odd integer k such that k · 2n + 1 is composite for all n > 0. It has been shown by Filaseta et al. [J. Number Theory 128: 1916–1940, 2008] that given any integer R > 0, there are integers k for which k, k2, k3, . . . , kR are each Sierpiński numbers. In this paper we seek to generalize this to bases other than 2.
Received: 2009-07-13
Revised: 2009-12-24
Accepted: 2010-04-20
Published Online: 2010-09-09
Published in Print: 2010-September
© de Gruyter 2010
