Thanks I got it. But I did it a bit differently so proof as follows:
Let n!=(2k)!
Let's name the set N={1,2,3,...,k,...p,...,2k} basically all the factors of n!
p is a prime between k and 2k which is true by Chebyshev (we're not ask to show this thank god)
-First we show that p does not...