Skip to content

Erdős Problem #793

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (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.

The question in plain language

F(n) is maximum cardinality A subset [1,n] with no a divides bc when a,b,c in A, a != b and a != c; b=c is ALLOWED. The question asks whether F(n)=pi(n)+(C+o(1)) n^(2/3)/(log n)^2 and determines C.

Proof-fidelity hold: the precise constant 27/2 is reported by the maintained catalogue from a GPT-assisted proof, but its full proof and coefficient have not been independently reproduced here. The catalogue status PROVED is not GCL mathematical certification.

A small example

A={2,3,4} is invalid: with a=4 and b=c=2, 4 divides 2*2 although a differs from both factors. Set of distinct primes <= n is admissible: if a is prime and differs from each prime b,c it cannot divide bc. Check n=4 gives admissible {2,3}. A={1} is admissible vacuously but cannot coexist with another member since 1 divides every product; vertex convention matters.

The calculation illustrates the exact definitions and hypotheses. No single finite example establishes the reported asymptotic assertion.

What is known

Live maintained /latex/793 on 2026-10-14 attributes exact asymptotic constant C=27/2 to a GPT-5.6 Sol construction/proof prompted by Chojecki, said to refine Erdős [Er38]. The original published Erdős 1938 lower/upper Theta term and Erdős 1969 simple O(n^(2/3)) bound are in the catalogue. The claimed proof of 27/2 itself is not independently inspected or formally verified. Catalogue PROVED status is secondary and must remain on editorial proof-fidelity HOLD.

Catalogue status: PROVED. The actual recorded source-audit disposition is STATUS_CONFLICT. These are different registers: a historical theorem report does not count as an independent GCL proof.

GCL's current state

The original authenticated RESULT/1 source return has historical disposition STATUS_CONFLICT. This status and the original research exceptions are preserved, not silently converted into a theorem verdict. The maintained Erdős source and source-specific mathematical definitions were reviewed, and this article is editorially reviewed as a source-exception-annotated explanation under EC-BULK-005-R10, effective only after the exact-hash protected admission merges.

Source interpretation and unresolved mathematical qualification: The maintained 27/2 asymptotic constant is model-assisted and not independently proof-replayed; a SOURCE_CONFLICT note must survive editorial acceptance.

The explanation is accepted for publication of established background, examples, and explicitly attributed current claims. It does not establish or formally certify the disputed original theorem, external model-assisted proof, historical interpretation, or any unreplayed Lean kernel file. Original source-fidelity and proof-review research holds remain.

What remains

Find reproducible exact full GPT-assisted proof/issue comment and original Er38 theorem pages. Independently check 27/2 coefficient and all distinctness quantifiers; build exhaustive F(n) oracle for n<=14. No mathematical proof certification or exact-hash editorial promotion until source-specific critical review.

Historical original papers require precise theorem/section matching where the return documents that they have not been independently inspected. Do not conceal these source-fidelity holds when conducting editorial review.

Sources and claim boundaries

  • Maintained Erdős Problem #793 and its LaTeX and bibliography, accessed 14 October 2026.
  • Authenticated source return on original GCL issue #2064. Named bibliography and the limits of historical-primary inspection are recorded there.
  • Pinned catalogue: teorth/erdosproblems at 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml, original source blob 4e60263a80af6207aca494d2e1388e44fa372889.
  • Editorial: editorially reviewed with source exception. Critical source/theorem review: PENDING. Public mathematical rendering: NOT VERIFIED. Mathematical certification: NONE.

Qualified editorial critical review: R10 source-exception dossier. The source-semantic exception is visible and its original research hold remains. Publication classification: REVIEWED EXPLANATORY ARTICLE WITH UNRESOLVED SOURCE/PROOF QUALIFICATIONS. Independent theorem proof or Lean certification: NOT CLAIMED.

Catalogue and evidence provenance

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