Wednesday, April 10, 2019

discrete mathematics - Prove $frac{1cdot 3cdot 5cdots (2n - 1)}{ 2^n(n + 1)!}cdot 4^n= frac{1}{n+1} {2nchoose n}$



Prove:
$$

\frac{1\times 3\times 5\times \cdots \times (2n - 1)}{2^n (n + 1)!} \times 4^n = \frac{1}{n+1} \binom{2n}{n}
$$





I'm having a bit of trouble proving this, I tried to prove this by induction and would get stuck. Any help is appreciated in advance.


Answer



By multiplying both numerator and denominator by $\;2\cdot 4\cdot 6 \cdot \ldots \cdot (2n)=2^nn!$ we get
\begin{align}
\frac{1\cdot 3\cdot 5\cdot \ldots \cdot (2n-1)}{2^n(n+1)!}&=\frac{1\cdot \color{red}{2}\cdot 3\cdot \color{red}{4}\cdot 5\cdot \color{red}{6}\cdot \ldots \cdot (2n-1)\cdot\color{red}{2n}}{2^n(n+1)!\cdot \color{red}{2^nn!}}\\

&=\frac{1}{4^n(n+1)}\cdot\frac{(2n)!}{n!\cdot n!}\\
&=\color{blue}{\frac{1}{4^n(n+1)}{2n \choose n}}
\end{align}



Then
$$\boxed{\color{blue}{4^n\left[\frac{1\cdot 3\cdot 5\cdot \ldots \cdot (2n-1)}{2^n(n+1)!}\right]=\frac{1}{n+1}{2n \choose n}}}$$


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...