<s>[INST] show that $(n+1)(n+2)...(2n)$ is divisible by $2^n$ but not by $2^{n+1}$ Is this proof correct?
Suppose $2^k$ is the largest power of $2$ in the sequence $n+1, n+2, ... 2n$
Then we can compute the power of 2 in the product as $n/2 + n/2^2 + ... n/2^k = n(1 + 2 + .... 2^{k-1})/2^k = n$. 
 [/INST] Note that
$$\dfrac{(n+1)(n+2)\dots (2n)}{1\cdot 3 \cdot 5 \dots (2n-1)} = \dfrac{(2n)!/n!}{(2n)!/(2\cdot 4 \cdot 6 \cdot \dots \cdot (2n))} = \dfrac{(2n)!/n!}{(2n)!/(2^n n!)} = 2^n$$
Hence,
$$(n+1)(n+2)\dots (2n) = 1\cdot 3 \cdot 5 \dots (2n-1) \cdot 2^n$$
Since the first $n$ multipliers on the right side are all odd, the maximum power of two that divides the product in question is indeed $2^n$.

Here is some intuition behind this solution.
First of all, it is clear that every natural number $m$ can be represented in the form $$m = 2^k \operatorname{maxodd}(m)$$
where $2^k$ is the maximum power of two that divides $m$ and $\operatorname{maxodd}(m)$ is the maximum odd divisor of $m$.
Note that the numbers in the range $[n+1, 2n]$ have different maximum odd divisors. Indeed, if for two different numbers in this range their maximum odd divisors were the same, one of them should be at least two times greater than the other one, which is impossible. This means that each of the number $1, 3, 5, \dots, 2n-1$ (here are exactly $n$ numbers) should be the maximum odd divisor for exactly one number from $[n+1, 2n]$ range. 
For example, if $n=5$ then $[n+1, 2n] = \{6, 7, 8, 9, 10\}$ and maximum odd divisors are $\{3, 7, 1, 9, 5\} = \{1, 3, 5, 7, 9\}$.
This means that the power of two in the product is equal to
$$\dfrac{(n+1)(n+2)\dots (2n)}{1\cdot 3 \cdot 5 \dots (2n-1)} = \dfrac{(2n)!/n!}{(2n)!/(2\cdot 4 \cdot 6 \cdot \dots \cdot (2n))} = \dfrac{(2n)!/n!}{(2n)!/(2^n n!)} = 2^n$$
</s>