Maths Olympiad Prep

Library / /432 of 520

Combinatorics Difficulty 6.0 National olympiad Prove it

Example 2. For any positive integer nn, prove:
k=0n2kCnkCnk[nk2]=C2n+1n \sum_{k=0}^{n} 2^{k} \mathrm{C}_{n}^{k} \mathrm{C}_{n-k}^{\left[\frac{n-k}{2}\right]}=\mathrm{C}_{2 n+1}^{n} \text {, }

where [x][x] denotes the greatest integer not exceeding the real number xx.

Solution

Prove the construction of the polynomial function
f(x)=(1+x)2n+1 f(x)=(1+x)^{2 n+1} \text {. }

Observe that, the right-hand side of the equation to be proved is obviously the coefficient of the nn-th term of f(x)f(x).
 Also, f(x)=(1+x)(1+2x+x2)n=(1+x)k=0nCnk(1+x2)nk(2x)k=k=0n2kCnk(1+x)(1+x2)nkxk, \begin{array}{l} \text { Also, } f(x)=(1+x)\left(1+2 x+x^{2}\right)^{n} \\ =(1+x) \sum_{k=0}^{n} \mathrm{C}_{n}^{k}\left(1+x^{2}\right)^{n-k}(2 x)^{k} \\ =\sum_{k=0}^{n} 2^{k} \mathrm{C}_{n}^{k}(1+x)\left(1+x^{2}\right)^{n-k} x^{k}, \end{array}

Then, when nkn-k is even, the coefficient of xnkx^{n-k} in (1+x)(1+x2)nk(1+x)\left(1+x^{2}\right)^{n-k} is Cnknk2\mathrm{C}_{n-k}^{\frac{n-k}{2}}; when nkn-k is odd, the coefficient of xnkx^{n-k} in (1+x)(1+x2)nk(1+x)\left(1+x^{2}\right)^{n-k} is Cnknk12\mathrm{C}_{n-k}^{\frac{n-k-1}{2}}.
Thus, for k=0,1,,nk=0,1, \cdots, n, in
2kCnk(1+x)(1+x2)nkxk 2^{k} \mathrm{C}_{n}^{k}(1+x)\left(1+x^{2}\right)^{n-k} x^{k}

the coefficient of xnx^{n} is always 2kCnkCnk[nk2]2^{k} \mathrm{C}_{n}^{k} \mathrm{C}_{n-k}^{\left[\frac{n-k}{2}\right]}.
Therefore, the coefficient of the nn-th term of f(x)f(x) is k=0n2kCnkCnk[nk2]\sum_{k=0}^{n} 2^{k} \mathrm{C}_{n}^{k} \mathrm{C}_{n-k}^{\left[\frac{n-k}{2}\right]}.
In conclusion, k=0n2kCnkCnk[nk2]=C2n+1n\sum_{k=0}^{n} 2^{k} \mathrm{C}_{n}^{k} \mathrm{C}_{n-k}^{\left[\frac{n-k}{2}\right]}=\mathrm{C}_{2 n+1}^{n}.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.