Erdős Problem #1113 — Sierpiński numbers with unbounded least prime divisors
A Sierpiński number is a positive odd integer for which is composite for every integer . A set of primes is a covering set for if
The question is whether there exists a Sierpiński number for which no finite set of primes is a covering set. The condition causes no discrepancy with the traditional definition using : fails the condition, and for any odd , is composite. Erdős Problems #1113 Izotov, A Note on Sierpinski Numbers (1995)
For a Sierpiński number let denote the least prime divisor of . The question is equivalently whether some such has unbounded least prime divisors:
Indeed, a finite cover bounds all the by its largest prime, while a bound on the makes the finite set of all primes up to that bound a cover. Erdős Problems #1113
Background
Sierpiński’s 1960 construction established that infinitely many odd integers are Sierpiński numbers by using finite sets of primes to cover all exponents. The construction works for integers satisfying suitable congruence conditions and yields a positive-density set of examples. The underlying periodicity is that, for an odd prime dividing a term, modulo repeats periodically; thus divisibility by a fixed prime occurs in recurring exponent classes. The problem asks whether Sierpiński numbers can exist without any finite collection of such recurring divisors accounting for every exponent. Erdős Problems #1113 Sierpiński (1960)
Erdős and Graham posed the question in Old and New Problems and Results in Combinatorial Number Theory (1980); it was later formulated precisely as problem F13 in Guy’s collection. The historical motivation was whether some Sierpiński numbers arise in a way not explained by a covering system. Erdős and Graham believed such examples should exist. Erdős Problems #1113 Erdős and Graham (1980)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.