Skip to content

Erdős Problem #1072

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

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

For a prime number \(p\), start with the sequence

\[ 0!+1,\quad 1!+1,\quad 2!+1,\quad3!+1,\ldots \]

and stop at the first term divisible by \(p\). Call its factorial index \(f(p)\). Erdős Problem #1072 asks two questions: are there infinitely many primes for which the first successful index is as late as \(p-1\)? And is \(f(p)\) usually much smaller than \(p\), in the precise sense that \(f(p)/p\to0\) for a density-one set of primes?

The word usually matters. It means all but a zero proportion among the primes, not a zero proportion of all integers.

A small example

For \(p=7\), the first successful index is \(3\), since

\[ 3!+1=7. \]

Thus \(f(7)=3\), considerably smaller than \(p-1=6\). For \(p=13\), none of the earlier factorials works, but \(12!+1\) is divisible by \(13\), so \(f(13)=12\).

Exact modular calculation for primes through \(150\) gives \(f(p)=p-1\) at

\[ p=3,5,13,17,31,37,41,53,73,89,97,101,107,113. \]

That finite list is not evidence of an infinity theorem. There is also an easily missed boundary case: when the minimization permits \(n=0\), one has \(f(2)=0\) because \(0!+1=2\). A convention requiring positive \(n\) would instead give \(f(2)=1\).

What is known

Wilson's theorem states that

\[ (p-1)!\equiv-1\pmod p \]

for every prime \(p\). Consequently \(f(p)\) always exists and, under the nonnegative convention, satisfies \(0\le f(p)\le p-1\).

That universal upper bound does not settle either distributional question. The historical formulation is attributed to Erdős, Hardy and Subbarao; their 2002 article also discusses how rarely the endpoint \(f(p)=p-1\) might occur. The maintained catalogue continues to regard the two main questions as open.

GCL's current state

Authenticated source audit #2343 compares the original problem description with the frozen Lean translation, which uses a nonnegative minimum and leaves both distribution conjectures unproved.

The finite modular factorial examples were independently calculated. The original 2002 Hardy–Subbarao paper has not yet been page-checked, and a later reported bound on a subsequence of ratios has not been accepted as an independently verified proof.

What remains

The required mathematical result is an infinitude theorem, a counterexample, or a density statement with rigorous quantifiers. The next bounded source task is to read the original 2002 article, reconstruct its precise conjectures, and reproduce a larger prime table by two independent algorithms. No finite table can prove the asymptotic assertion.

Sources and claim boundaries

Catalogue and evidence provenance

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