New at De Gruyter
Editor-in-Chief: Nathanson, Melvyn B. / Nešetril, Jaroslav / Pomerance, Carl
Managing Editor: Landman, Bruce M. / Robertson, Aaron
Editorial Board Member: Nowakowski, Richard J. / Fraenkel, Aviezri / Ruzsa, Imre / Wilf, Herb / Andrews, George / Berlekamp, Elwyn / Brown, Ezra / Brown, Tom / Canfield, E.Rodney / Chung, Fan / Goldston, Daniel A. / Gowers, William Timothy / Graham, Ronald / Granville, Andrew / Griggs, Jerrold / Guy, Richard / Harborth, Heiko / Hindman, Neil / Leader, Imre / Lefmann, Hanno / Ono, Ken / Rödl, Vojtech / Serra, Oriol / Solymosi, Jozsef / Sós, Vera T. / Tichy, Robert F. / Winkler, Peter / Zeilberger, Doron / Prömel, Hans Jürgen
Mathematical Citation Quotient 2011: 0.23
1Department of Mathematics and Statistics, University of Tennessee at Martin, Martin, TN 38238, USA. E-mail: caldwell@utm.edu
2Department of Mathematical Sciences, Hirosaki University, Hirosaki 036-8561, Japan. E-mail: komatsu@cc.hirosaki-u.ac.jp
Citation Information: Integers. Volume 10, Issue 4, Pages 423–436, ISSN (Print) 1867-0652, DOI: 10.1515/integ.2010.036, September 2010
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, k 2, k 3, . . . , kR are each Sierpiński numbers. In this paper we seek to generalize this to bases other than 2.
Keywords.: Sierpiński number; covering set; generalized Fermat number
Comments (0)