Erdős Problem #795
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
Let g(n) be maximum cardinality of A subset [1,n] with distinct products over every two different SUBSETS of A, each original element included at most once; empty product=1. Determine second-order term beyond pi(n).
Primary-source improvement: Raghavan, Acta Mathematica Hungarica 177 (2025), 363–377, DOI 10.1007/s10474-025-01578-4, Theorem 1.3: the published O(N^(5/12)) remainder is stronger than the initial arXiv O(N^(5/12+o(1))) remainder. The prime-and-prime-square construction supplies the elementary sharp lower term.
A small example
Set A={2,3,4,9}, comprised of primes and prime squares, has sixteen distinct subset products: prime exponents (0,1,2,3) for each prime 2 and 3 are uniquely encoded by including p and/or p²; in contrast {2,3,6} is invalid because 2*3=6. Presence of 1 also forces collision with empty product.
The calculation illustrates the exact definitions and hypotheses. No single finite example establishes the reported asymptotic assertion.
What is known
Primary published R. Raghavan, Sharp bounds for sets with distinct subset products, Acta Math Hungar 177 (2025), 363–377, DOI 10.1007/s10474-025-01578-4, open-access abstract and Theorem 1.3 located: g(N)=pi(N)+pi(sqrt N)+O(N^(5/12)), an improvement over catalogue's arXiv citation O(N^(5/12+o(1))). Maintained /latex/795 still uses inconsistent 'x' in n-indexed error term; normalize to N. Stronger proposed exact sparse-power expansion is separate and contradicted by Raghavan lower bound.
Catalogue status: PROVED. The actual recorded source-audit disposition is SOURCE_LOCK_READY. These are different registers: a historical theorem report does not count as an independent GCL proof.
GCL's current state
The authenticated original RESULT/1 source return records SOURCE_LOCK_READY and preserves its issue-bound mathematical source observations. This explanatory article is REVIEWED under the exact-hash EC-BULK-005-R6 editorial transaction, subject to the protected merge of PR #2676. Its original source-audit status is retained. Editorial acceptance and public MathJax validation do not certify any original research theorem, external Lean file, or complete historical proof.
Unclosed mathematical proof/source qualifications: FULL_RAGHAVAN_PUBLISHED_PROOF_NOT_REDERIVED; SEPARATE_STRONGER_CONJECTURE_NOT_CLAIMED.
What remains
Independently check open-access paper proof of Theorem 1.3, the improved O(N^(5/12)) acknowledgement versus earlier versions, and the strengthened lower bound; build exact n<=14 subset-product enumeration. Do not claim novel proof or global exact g(n) formula.
For mathematical proof certification, the complete primary argument and any external formalization must undergo separate independent replay. The bounded finite calculation is recorded in the governed R6 fixture; editorial approval does not discharge the outstanding research obligations.
Sources and claim boundaries
- Maintained Erdős Problem #795 and its LaTeX and bibliography, accessed 14 October 2026.
- Authenticated source return on original GCL issue #2066. 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 decision: exact-hash reviewed explanatory article, protected R6 transaction. Mathematical theorem proof / external Lean certification: NOT CLAIMED. The original SOURCE_LOCK_READY return, primary-source attribution, and proof-review holds remain.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2066 — 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.