Erdős Problem #796
Editorial depth: Reviewed explanatory article — evidence qualified.
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.
The question in plain language
For fixed k>=2 let g_k(n) be the maximal size A subset [1,n] such that each integer m has fewer than k unordered representations a1*a2=m with DISTINCT elements a1<a2 in A. Is there a second-order constant c for g_3(n) after the leading n loglog n/log n?
Source-normalization hold: the older log-squared denominator conflicts with the scale inferred from the 1964 arguments. Do not assert a second-order constant or silently select one convention until historical papers are inspected.
A small example
A={2,3,5,7} has all 6 unordered distinct pair products 6,10,14,15,21,35, so each m occurs once, meeting k=2 and k=3. A={2,3,4,6} has 26=34=12, so it meets k=3 (at most two representations) but violates k=2. This precisely tests strict <k.
The calculation illustrates the exact definitions and hypotheses. No single finite example establishes the reported asymptotic assertion.
What is known
Live /latex/796 records Erdős [Er64d] known first-order: if 2^(r-1)<k<=2^r then g_k(n)~n (loglog n)^(r-1)/((r-1)! log n). For k=3 r=2. Catalogue points out Er69 printed second term n/(log n)^2 whereas Er64d's techniques already imply two-sided positive n/log n corrections; historical typo suspected. Original Er64d and Er69 printed pages NOT directly inspected here. Preserve logarithmic denominator as explicit SOURCE_CONFLICT, status OPEN for constant.
Catalogue status: OPEN. 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 original logarithmic second-order term has log(n) versus log(n)^2 source discrepancy; historical prints need direct verification before coefficient claims.
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
Source-lock 1964 and 1969 original statements, compare log n versus log^2 n and constants. Exact finite oracle for n<=12 by counting unordered distinct pair products; refrain from inferring a second-order limit from first-order asymptotics.
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 #796 and its LaTeX and bibliography, accessed 14 October 2026.
- Authenticated source return on original GCL issue #2067. 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: #2067 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: FORMAL_SOURCE_REFRESH_REQUIRED.
- 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.