Erdős Problem #829
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 A={positive perfect cubes}, define (1_A * 1_A)(n)=#{(a,b) in A²:a+b=n}; this is the ORDERED number of representations as two positive cubes, and includes a=b where applicable. Is this uniformly <=(log n)^C for some ABSOLUTE C and all sufficiently large n? OPEN.
A small example
1729=1^3+12^3=9^3+10^3 yields FOUR ordered representations ((1,12),(12,1),(9,10),(10,9)), not two when using convolution. Brute force cubes up to 14 detects precisely this first familiar multiplicity example.
The example can be checked exactly. A finite witness does not replace the universal, asymptotic, or infinitely-often quantifiers in the original question.
What is known
Maintained https://www.erdosproblems.com/latex/829 OPEN. Mordell proved unbounded limsup of representation count. Mahler [Ma35b] infinitely often >= const (log n)^(1/4), Stewart [St08] improves infinitely often to >=const (log n)^(11/13). Lower on a subsequence does not contradict any sufficiently large polylog UPPER. Original proofs not reproduced.
The convolution counts ordered pairs:
$$
(1_A*1_A)(N) =#{(u,v)\in\mathbb N^2:u^3+v^3=N}.
$$
For the taxi-cab integer,
$$
1729=1^3+12^3=9^3+10^3,
$$
the ordered count is four, not two. Known lower bounds showing unbounded representations, even as powers of \(\log N\) on infinitely many inputs, do not disprove the desired upper bound by some other fixed logarithmic power.
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: open cube pair sum polylog upper ordered convolution. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Enumerate ordered pairs of positive cubes to finite cutoff, check 1729 multiplicity and separate ordered from unordered. Source-lock Mordell–Mahler–Stewart exponents and ensure limsup/infinite subsequences are not turned into upper bounds.
Independent critical review must compare the historical primary theorem to the written quantifiers, inspect the exact finite fixture, determine whether a claimed status refers to the whole question or a subcase, and validate the actual rendered mathematical output. No protected admission or formal theorem certification is claimed.
Sources and claim boundaries
- Maintained Erdős problem #829 and its LaTeX/bibliography, read 14 October 2026.
- Authenticated original GitHub source-return record. All original historical bibliography, quantified status limitations and exact source observations are recorded in that return.
- Source theorem proof: PARTIAL and identified where unread. Independent mathematical acceptance: PENDING. Protected merge: NONE. Deployed MathJax: NOT VERIFIED. External Lean certification by GCL: NONE.
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: #2100 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.