Skip to content

Erdős Problem #1140

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

Can there be infinitely many positive integers \(n\) such that every number of the form \(n-2x^2\) is prime whenever \(x\) is an integer and \(2x^2<n\)?

Erdős Problem #1140 has a negative answer: only finitely many such integers exist, according to published results of Epure and Gică and earlier work.

The phrase every integer \(x\) includes \(x=0\). Therefore the condition requires \(n=n-2\cdot0^2\) itself to be prime. Omitting zero changes the problem.

A small example

Checking every integer \(x\) with \(2x^2<n\) for each \(2\le n\le2000\) yields exactly

\[ 2,\ 5,\ 7,\ 13,\ 31,\ 61,\ 181,\ 199. \]

These agree with the known list reported by the catalogue.

For example, \(n=4\) might appear to work if we check only positive \(x\), because \(4-2=2\). But \(x=0\) gives \(4\), which is not prime. Similarly the misleading positive-only test admits some other composite candidates.

A finite search cannot rule out any exceptional integer larger than its cutoff.

What is known

Epure and Gică (2010, Theorem 4.1) established that the only examples congruent to \(1\bmod4\) are \(5,13,61,181\).

For the class \(n\equiv3\bmod4\), their arguments combined with Mollin and Williams (1989) imply that the known examples are \(7,31,199\), with at most one additional exception. The exceptional possibility has not been excluded in the maintained account.

The existence of at most one extra integer is already enough to disprove infinitude, but it is not a proof that the eight known integers form the complete list.

GCL's current state

Authenticated audit #2411 verifies the list through 2,000 and explicitly corrects the \(x=0\) convention. The general number-theoretic theorem remains externally sourced, not independently replayed.

What remains

Review the complete Epure–Gică and Mollin–Williams arguments, identify the exceptional-case conditions precisely, and avoid asserting that the possible ninth example cannot exist without an additional proof.

Sources and claim boundaries

Erdős #1140; catalogue LaTeX source; Epure–Gică (2010); Mollin–Williams (1989); GCL return. Finite computation independent; externally disproved, complete list not certified. Unaccepted draft.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2411 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider 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