Skip to content

Erdős Problem #764

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (not automatically the live result).
Subject areas: number theory, additive combinatorics.

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 \(A\) a set of positive integers, define the triple convolution

\[ r_3(n)=(\mathbf{1}_A*\mathbf{1}_A*\mathbf{1}_A)(n). \]

This counts ORDERED triples \(a+b+c=n\). Erdős–Turán's stronger-summand analogue asks if the cumulative representation total \(\sum_{n\le N}r_3(n)=cN+O(1)\) can hold for some c>0. Vaughan [Va72] proved the answer NO; the source reports a stronger impossibility with discrepancy \(o(N^{1/4}/\sqrt{\log N})\), extending to general h-fold convolutions under suitable main terms.

A small example

If A={1,2}, its ordered triples give \(r_3(3)\)=1, \(r_3(4)\)=3, \(r_3(5)\)=3 and \(r_3(6)\)=1, totaling 8 through N=6. For A=all positive integers, \(r_3(n)=\binom{n-1}{2}\) for n≥3, so the cumulative count grows like N³/6 rather than cN. These examples illustrate ordering and triple convolution but cannot prove Vaughan's uniform no-go theorem.

What is known

Erdős–Fuchs #763 is the two-fold analogue. The maintained page attributes the three-fold impossibility to Vaughan 1972 [Va72], including impossibility of error \(o(N^{1/4}/(\log N)^{1/2})\), and a more general h-fold theorem allowing different main terms. Do not casually transfer the later Montgomery–Vaughan \(o(N^{1/4})\) improvement for two-fold sums to h=3 without inspecting primary hypotheses. The original Vaughan proof was not independently rederived.

GCL's current state

The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.

Preserved source-review qualifications: vaughan triple and h fold disproof; do not transfer two sum stronger error. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Implement exact ordered triple representation counts for finite A and prove \(r_3(n)=\binom{n-1}{2}\) for A=N_{>0}. Then read Vaughan 1972 primary theorem, including any h-dependent growth/main-term restrictions. Keep this result distinct from Erdős–Fuchs two-summand proof.

Sources and claim boundaries

Maintained #764; authenticated source return. Historic primary proofs, external Lean and deployed browser MathJax not fully audited. source-qualified editorial review recorded.

Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.

Catalogue and evidence provenance

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