GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Algebra
  • Applied Mathematics
  • Calculus and Analysis
  • Discrete Mathematics
  • Foundations of Mathematics
  • Geometry
  • History and Terminology
  • Number Theory
  • Probability and Statistics
  • Recreational Mathematics
  • Topology
  • Alphabetical Index
  • Random Entry
  • New in MathWorld

This view

  • Original page
  • New address

GeezerVison is showing mathworld.wolfram.com — Sierpiński's Composite Number Theorem -- from Wolfram MathWorld

Search

Sierpiński's Composite Number Theorem

As proved by Sierpiński (1960), there exist infinitely many positive odd numbers k such that k·2^n+1 is composite for every n>=1. Numbers k with this property are called Sierpiński numbers of the second kind, and analogous numbers with the plus sign replaced by a minus are called Riesel numbers. It is conjectured that the smallest value of k for a Sierpiński number of the second kind is k=78557 (although a handful of smaller candidates remain to be eliminated) and that the smallest Riesel number is k=509203.

See also

Cunningham Number, Proth Number, Proth Prime, Riesel Number, Sierpiński Number of the Second Kind, Sierpiński's Prime Sequence Theorem

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

  • de Polignac's conjecture
  • Goldbach conjecture
  • 3.14159265

References

Ballinger, R. "The Riesel Problem: Definition and Status." http://www.prothsearch.com/rieselprob.html.Ballinger, R. "The Sierpinski Problem: Definition and Status." http://www.prothsearch.com/sierp.html.Ballinger, R. and Keller, W. "The Riesel Problem: Search for Remaining Candidates." http://www.prothsearch.net/rieselsearch.html.Buell, D. A. and Young, J. "Some Large Primes and the Sierpiński Problem." SRC Tech. Rep. 88004, Supercomputing Research Center, Lanham, MD, 1988.Caldwell, C. "Seventeen or Bust." https://t5k.org/bios/page.php?id=429.Helm, L. and Norris, D. "Seventeen or Bust: A Distributed Attack on the Sierpinski Problem." https://web.archive.org/web/20160405211049/http://seventeenorbust.com:80/.Jaeschke, G. "On the Smallest k Such That k·2^N+1 Are Composite." Math. Comput. 40, 381-384, 1983.Jaeschke, G. Corrigendum to "On the Smallest k Such That k·2^N+1 Are Composite." Math. Comput. 45, 637, 1985.Keller, W. "Factors of Fermat Numbers and Large Primes of the Form k·2^n+1." Math. Comput. 41, 661-673, 1983.Keller, W. "Factors of Fermat Numbers and Large Primes of the Form k·2^n+1, II." Preprint available at http://www.rrz.uni-hamburg.de/RRZ/W.Keller/.Ribenboim, P. The New Book of Prime Number Records. New York: Springer-Verlag, pp. 357-359, 1996.Riesel, H. "Några stora primtal." Elementa 39, 258-260, 1956.Sierpiński, W. "Sur un problème concernant les nombres k·2^n+1." Elem. d. Math. 15, 73-74, 1960.

Referenced on Wolfram|Alpha

Sierpiński's Composite Number Theorem

Cite this as:

Weisstein, Eric W. "Sierpiński's Composite Number Theorem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SierpinskisCompositeNumberTheorem.html

Subject classifications

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.