Maths Olympiad Prep

Library / /406 of 520

Combinatorics Difficulty 5.7 AIME, harder Prove it

Example 1: Prove that k=150C1948+kk=C199919491\sum_{k=1}^{50} \mathrm{C}_{1948+k}^{k}=\mathrm{C}_{1999}^{1949}-1.

Analysis: Observing the characteristics of the equation, it is easy to think of using the properties of binomial coefficients Cnk=Cnnk\mathrm{C}_{n}^{k}=\mathrm{C}_{n}^{n-k} and Cnk1+Cnk=Cn+1k\mathrm{C}_{n}^{k-1}+\mathrm{C}_{n}^{k}=\mathrm{C}_{n+1}^{k} to solve the problem.

Solution

Prove: k=150C1948+kk=k=150C1948+k1948=C19991949+k=150C1948+k19481=C199919491.\begin{aligned} & \sum_{k=1}^{50} \mathrm{C}_{1948+k}^{k}=\sum_{k=1}^{50} \mathrm{C}_{1948+k}^{1948} \\ & =\mathrm{C}_{1999}^{1949}+\sum_{k=1}^{50} \mathrm{C}_{1948+k}^{1948}-1 \\ & =\mathrm{C}_{1999}^{1949}-1 .\end{aligned}

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.