Powers of Sierpiński Numbers Base b

@inproceedings{Caldwell2010PowersOS,
  title={Powers of Sierpiński Numbers Base b},
  author={C. Caldwell and T. Komatsu},
  booktitle={Integers},
  year={2010}
}
Abstract A Sierpiński number is a positive odd integer k such that k · 2 n + 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. 

Tables and Topics from this paper

A role for generalized Fermat numbers
On the Exponents of Non-Trivial Divisors of Odd Numbers and a Generalization of Proth's Primality Theorem
  • Tom Müller
  • Mathematics, Computer Science
  • J. Integer Seq.
  • 2017

References

SHOWING 1-10 OF 18 REFERENCES
Variations on a Theme of Sierpinski
Factors of generalized Fermat numbers
Unsolved Problems in Number Theory
An Introduction to the Theory of Numbers
An Introduction to the Theory of Numbers
C
  • Finch & M. Kozek, On powers associated with Sierpiński numbers, Riesel numbers and Polignac’s conjecture, J. Number Theory, 128:7
  • 2008
Sierpiński conjecture reservations, May 2008, http://gbarnes017.googlepages.com/Sierp-conjecture-reserves.htm
  • 2008
Some computational experiments in number theory
...
1
2
...