Skip to content

Erdős Problem #1113

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, covering systems.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

Take an odd positive integer \(m\). If

\[ 2^k m+1 \]

is composite for every integer \(k\ge0\), then \(m\) is called a Sierpiński number.

Some Sierpiński numbers have a simple certificate: a finite collection of primes so that every member of the sequence is divisible by at least one of those primes. This is called a finite prime covering.

Erdős Problem #1113 asks whether there can be a Sierpiński number without any finite prime covering. The existence of numbers with finite coverings is already known; the possible absence of such a certificate is the hard question.

A small example

The classical number

\[ m=78557 \]

has a finite prime covering

\[ P=\{3,5,7,13,19,37,73\}. \]

This can be checked exactly, without testing infinitely many exponents. The multiplicative orders of two modulo these primes are respectively

\[ 2,4,3,12,18,36,9. \]

A particular prime divides \(2^k m+1\) when \(k\) lies in one residue class modulo its order. For the seven primes these classes are respectively \(0,1,1,11,15,27,3\).

Their common period is \(\mathrm{lcm}(2,4,3,12,18,36,9)=36\). Direct modular arithmetic verifies that all 36 residue classes of \(k\) are covered.

Since \(2^k78557+1\) exceeds every covering prime, the divisor is proper. Therefore every expression is composite, for all \(k\ge0\). This is a rigorous example of a Sierpiński number with a finite covering, not an example answering Erdős's open question.

What is known

Sierpiński (1960) proved that infinitely many such numbers exist, using covering constructions.

The maintained catalogue reports that Izotov (1995) proved a much larger fourth-power candidate was a Sierpiński number. Filaseta, Finch and Kozek (2008) discussed why it might have no finite covering, but the evidence reported is not a proof that no such covering exists.

They also proposed a refined possibility: perhaps a Sierpiński number either is a perfect power or has a finite covering. That is a different unresolved statement.

GCL's current state

Authenticated source audit #2384 verifies the entire 36-residue covering certificate using exact modular arithmetic.

The frozen formal-conjectures source distinguishes the known infinitely-many theorem from the open no-cover statement. Its proof declarations have not been independently kernel-replayed.

What remains

Read the original Erdős–Graham, Izotov and Filaseta–Finch–Kozek proofs. In particular, distinguish a proof that every term is composite from a proof that no finite family of primes can cover all terms. The latter is a substantially stronger claim and remains open.

Sources and claim boundaries

Erdős Problem #1113; Sierpiński (1960); Erdős–Graham (1980), p. 27; Izotov (1995); Filaseta–Finch–Kozek (2008); GCL audit #2384. The \(78557\) covering is independently proved by finite periodic arithmetic; it does not establish the open cover-free conjecture. Unaccepted draft.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2384 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction