Sierpiński numbers
Generated by GPT-5-miniExpansion Funnel Raw 41 → Dedup 0 → NER 0 → Enqueued 0
| Sierpiński numbers | |
|---|---|
| Name | Sierpiński numbers |
| Field | Number theory |
| Introduced | 1960s |
| Named after | Wacław Sierpiński |
Sierpiński numbers are odd integers k>1 for which k·2^n+1 is composite for every positive integer n. They arise in problems linking primality, covering congruences, and computational searches, intersecting the work of several twentieth‑ and twenty‑first‑century mathematicians and collaborative projects.
Definition
A Sierpiński number is an odd integer k>1 such that the sequence k·2^n+1 contains no prime terms for any positive integer n. The definition was formulated in the context of research by Wacław Sierpiński and relates to classical studies of prime‑producing polynomials and exponential sequences by figures like Édouard Lucas, Adrien-Marie Legendre, and later researchers connected to the Pratt certificate concept and the development of distributed computing projects such as Great Internet Mersenne Prime Search and PrimeGrid.
History and Sierpiński's Problem
Sierpiński posed the problem of characterizing such k in the 1960s; his statement led to the identification of several candidate values and to the conjecture that infinitely many k exhibit the property. The problem connects to earlier investigations by Srinivasa Ramanujan and Paul Erdős into covering systems and to later work by John Selfridge who contributed explicit examples. The computational facet grew through collaborations involving organizations like University of Central Missouri researchers and volunteers from Distributed.net and PrimeGrid, mirroring efforts in the search for Mersenne primes and investigations guided by methods used by Atkin–Morain and others.
Known Results and Examples
Concrete instances of numbers shown to be Sierpiński include explicit k found using covering congruences demonstrated by Sierpiński and refined by Selfridge; one historically significant value was established through congruence coverings involving small primes and properties studied by Leonhard Euler and Joseph-Louis Lagrange in related contexts. Work by teams affiliated with University of Tennessee and projects like Seventeen or Bust narrowed candidate lists, leveraging computational results akin to those in searches for Fermat number factors and studies by Dudley Herschbach-era computational chemistry groups that inspired large‑scale computation. Known composite certificates for many k rely on factorization data contributed by researchers at institutes such as Mathematical Institute, University of Oxford and laboratories collaborating with Los Alamos National Laboratory style computational resources.
Methods of Proof and Computational Approaches
Proofs that a given k is Sierpiński typically use a finite covering set of congruences showing for each n there exists a small prime p dividing k·2^n+1; these methods trace back to techniques in work by Paul Erdős on covering systems and to classical modular arithmetic deployed by Carl Friedrich Gauss and Sophie Germain in contexts of prime divisibility. Computational approaches combine distributed sieving, elliptic curve factorization methods inspired by Hendrik Lenstra, and generalized number field sieve strategies developed by teams at institutions such as CWI and IBM Research. Projects like Seventeen or Bust and PrimeGrid coordinate volunteers using software based on contributions from developers and mathematicians associated with MIT and University College London.
Related Concepts and Generalizations
Related notions include Riesel numbers, which concern k·2^n−1 and connect to research by Hans Riesel and collaborators; these relate to the study of Mersenne numbers and to primality testing algorithms such as the Lucas–Lehmer test and APR test. Generalizations consider sequences k·b^n±1 for bases b>2, tying into work on repunits investigated by Édouard Lucas and studies of cyclotomic polynomials examined by Richard Dedekind and Ernst Kummer. Connections to covering congruences recall themes from Paul Erdős's covering systems research and to conjectures explored by contemporary number theorists at institutions like Princeton University and ETH Zurich.
Open Problems and Conjectures
Principal open questions include whether there are infinitely many Sierpiński numbers and the complete classification of minimal Sierpiński k values; these conjectures echo unresolved problems in primality distribution studied by G. H. Hardy and John Littlewood. The computational frontier remains active: finishing verification for sets of candidate k and discovering minimal covers involves collaborations among groups such as PrimeGrid and research teams at universities including University of Illinois and University of Cambridge.