Skip to content

Erdős Problem #1059

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

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

Subtract a factorial from a prime number. Since factorials grow rapidly, only finitely many \(k!\) are smaller than any fixed prime \(p\). Erdős Problem #1059 asks whether there are infinitely many primes \(p\) for which

\[ p-k!\quad\text{is composite for every }k\ge1\text{ with }k!<p. \]

The requirement is every eligible factorial, not just one convenient subtraction. An integer equal to \(1\) does not qualify as composite, either.

A small example

For \(p=101\), the eligible factorials are \(1,2,6,24\). The differences factor as

\[ \begin{aligned} 101-1&=100=2^2\cdot5^2,\\ 101-2&=99=3^2\cdot11,\\ 101-6&=95=5\cdot19,\\ 101-24&=77=7\cdot11. \end{aligned} \]

For \(p=211\), the differences for \(k=1,\ldots,5\) are \(210\), \(209\), \(205\), \(187\), \(91\), factoring respectively as \(2\cdot3\cdot5\cdot7\), \(11\cdot19\), \(5\cdot41\), \(11\cdot17\), and \(7\cdot13\). We independently verified the primality of \(101\) and \(211\) and each displayed composite factorization.

These are two genuine examples. Two examples do not prove there are infinitely many such primes.

What is known

The canonical catalogue marks the question open and records \(101\) and \(211\) as examples. It traces the historical question to Erdős via problem A2 of Richard Guy's Unsolved Problems in Number Theory.

An associated suggestion attributed to Erdős seeks a weaker-looking construction among integers whose prime factors all exceed a specified factorial index. Such an auxiliary route is not the original prime-only quantifier and must be kept separate.

GCL's current state

Authenticated audit #2330 independently checks the two known prime examples and reads the frozen formal-conjectures file. The Lean statement takes the set of factorial values below \(p\) and requires each subtraction to be composite.

The factorial value \(1\) may arise as both \(0!\) and \(1!\), but considering a set of factorial values avoids double counting and does not alter the universal statement. The general infinitude claim in the frozen file remains unproved. Neither formal metadata nor finite examples provide an independently certified solution.

What remains

The central mathematical task is to prove there are infinitely many qualifying primes or show that only finitely many exist. A bounded supporting investigation can enumerate qualifying primes through a stated finite limit with independently checked primality and factorial calculations, and reconcile Guy's exact historical statement with the Lean predicate. Such an enumeration would be evidence about small cases, not a proof of infinitude.

Sources and claim boundaries

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2330 — 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