Prove that highest power of 2 in \(2n!\) is strictly greater than the highest power of 2 in \(n!^2\).
This is kind of a corollary from another fundamental theorem. If you know that theorem, then this problem is nothing.
And this one is original to the best of my knowledge. I got it from the theorem.