olymmath

CAPS 1998 Problem 6

    In a summer camp there are nn girls D1,D2,...,DnD_1,D_2, ... ,D_n and 2n−12n-1 boys C1,C2,...,C2n−1C_1,C_2, ...,C_{2n-1} . The girl Di,i=1,2,...,n,D_i, i = 1,2,... ,n, knows only the boys C1,C2,...,C2i−1C_1,C_2, ... ,C_{2i-1} . Let A(n,r)A(n, r) be the number of different ways in which rr girls can dance with rr boys forming rr pairs, each girl with a boy she knows. Prove that A(n,r)=(nr)r!(n−r)!.A(n, r) = \binom{n}{r} \frac{r!}{(n-r)!}.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator caps/1998/p6 · Tag Y7S72GPCA1 · Edit this page on GitHub · Keys: j next, k previous