I am trying to prove that $\dfrac{(2n)!}{2^n}$ is integer. So I have tried it by induction, I have took $n=1$, for which we would have $2/2=1$ is integer. So for $n=k$ it is true, so now comes time to proof it for $k+1$, $(2(n+1))!=(2n+2)!$, which is equal to $1 \times 2 \times 3 \times \cdots \times (2n) \times (2n+1) \times (2n+2),$ second term would be $2^{n+1}=2 \times 2^n$ Finally if we divide $(1 \times 2 \times 3 \times \cdots \times (2n) \times (2n+1) \times (2n+2)$ by $2^{n+1}=2 \times 2^n$,and consider that,$(2n)!/(2^n)$ is integer, we get $(2n+1) \times (2n+2)/2=(2n+1) \times 2 \times (n+1)/2$, we can cancel out $2$, we get $(2n+1)(n+1)$ which is definitely integer. I am curious this so simple? Does it means that I have proved correctly?
Proof that $\frac{(2n)!}{2^n}$ is integer
-
1Possible duplicate of [prove that $\frac{(2n)!}{(n!)^2}$ is even if $n$ is a positive integer](https://math.stackexchange.com/questions/78533/prove-that-frac2nn2-is-even-if-n-is-a-positive-integer) – 2017-09-04
3 Answers
Yes, you have proved it correctly. Indeed the proof is not difficult. If you need to do a formal induction, fine. But the result becomes obvious if you just expand, say, $(2\cdot 5)!$. It is clear that you pick up at least five $2$'s.
If you do need to write out a formal induction, it could be written out somewhat more clearly. For example, the phrase "so for $n=k$ it is true" is not clear. I assume you mean that "so if for $n=k$ it is true." We now write out a proof.
The result is obviously true for $n=1$. We show that if it is true for $n=k$, it is true for $n=k+1$.
Note that $(2\cdot (k+1))!=(2k)!(2k+1)(2k+2).$ By the induction assumption, $2^k$ divides $(2k)!$. It follows that $2^{k+1}$ divides $(2k)!(2)$, and therefore $2^{k+1}$ divides $(2k)!(2k+1)(2k+2)$.
-
0@celschk, this is wrong. I can define $P(n)$ as "$2 n + 1$ is even." Then $P(n + 1)$ is that $(2 n + 1) + 2$ is even, and as even + even is even, this is true. Similarly for $P(n - 1)$. All odd integers are even. – 2014-05-02
From 1 to $2n$ there are exactly $n$ even numbers. Hence the product $1\cdots 2n=(2n)!$ is divisible by $2\cdot2\cdots 2 \hbox{ ($n$ times)}= 2^n$.
-
1It's as simple as that... – 2013-07-18
Suppose there are $n$ distinct objects in a set $D$.
Consider a set $S$ containing $2$ copies of each element from $D$. Then $S$ has total $2n$ objects.
Total number of permuatations of these objects $=\dfrac{(2n)!}{(2!)^n}=\dfrac{(2n)!}{2^n}$.
Since number of permutations is an integer, therefore, $\dfrac{(2n)!}{2^n}$ is an integer.
-
0I'm not comfortable with the phrase "we take another set of same objects". I think you count the "multset permutations" of a multiset on $n$ values, each one occurring exactly twice; to me that is a clearer description, because I know what multiset permutations are (and that one cannot compose them). Another form of the same argument: if in the symmetric group $S_{2n}$ one selects $n$ disjoint $2$-cycles, then these generate a subgroup with $2^n$ elements; now it's Lagrange's thoerem. – 2012-07-09