Skip to content

Erdős Problem #1141

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: disproved (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

For which positive integers \(n\) is

\[ n-k^2 \]

prime whenever \(k^2<n\) and the integer \(k\) is coprime to \(n\)?

Erdős Problem #1141 asks whether infinitely many such \(n\) exist. The maintained catalogue now reports a negative solution with Lean verification, although the external proof has not been independently replayed by GCL.

The coprimality condition makes this different from #1140. In particular, \(n\) itself need not be prime.

A small example

The historical suggestion that \(968\) might be the largest qualifying number is incorrect:

\[ 968-3^2=959=7\cdot137, \]

and \(\gcd(3,968)=1\). Therefore \(968\) does not satisfy the condition.

Exact primality and gcd checks through \(n=2500\) find 41 qualifying integers, including \(1722\). The latter is the largest currently reported example, not a proved global maximum.

What is known

Earlier work by ChatGPT and Tang, cited on the maintained page, bounded the number of qualifying \(n\le N\) by \(N^{1/2+o(1)}\). Such a sparsity estimate does not show there are finitely many.

A later 2026 contribution, [APSSV26b], reportedly uses a theorem of Pollack (2017) to establish finiteness for a more general family:

\[ n-ak^2\text{ prime for all eligible }k,\qquad a\ge1. \]

This stronger result is what disproves the infinitude conjecture. The maintained page also reports Lean verification, but a GCL kernel and assumption audit is still required.

GCL's current state

Authenticated source audit #2412 independently checks the small examples and distinguishes a counting bound from a finiteness theorem.

What remains

Review Pollack's source and the 2026 generalization, confirm the exact quantifiers over \(a,n,k\), and source-pin and kernel-replay the claimed Lean proof, including its dependency and axiom closure.

Sources and claim boundaries

Erdős #1141; Pollack (2017); [APSSV26b] as reported; GCL return. Finite tests independently verified; externally disproved, formal proof not independently certified. Unaccepted draft.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2412 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • 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