Skip to content

Erdős problem 829

Start work

Erdős Problem 829 (open). Let A⊆NA \subseteq \mathbb{N} be the set of perfect cubes. Is it true that (1A∗1A)(n)≪(log⁡n)O(1)(1_A \ast 1_A)(n) \ll (\log n)^{O(1)}? That is, does there exist a natural number CC such that the number of representations of nn as a sum of two cubes is O((log⁡n)C)O((\log n)^C) as n→∞n \to \infty?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:bfbc901908a298f448e7c7811aa0c9b8f61fcef15a0594e2060d5e99eeae49a5
Metadata
sha256:6b150858080a865b2bcf0ba5f9ecbca4f3addce3308c823aa4308f93953fdcf1
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:127a20eece209ccc16cd31d516488046390cf775c8fe046fdabe9842fa955df9
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON