返回题库

AIME 2020 I · 第 7 题

AIME 2020 I — Problem 7

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

A club consisting of 1111 men and 1212 women needs to choose a committee from among its members so that the number of women on the committee is one more than the number of men on the committee. The committee could have as few as 11 member or as many as 2323 members. Let NN be the number of such committees that can be formed. Find the sum of the prime numbers that divide N.N.

解析

Solution 1

Let kk be the number of women selected. Then, the number of men not selected is 11(k1)=12k11-(k-1)=12-k. Note that the sum of the number of women selected and the number of men not selected is constant at 1212. Each combination of women selected and men not selected corresponds to a committee selection. Since choosing 12 individuals from the total of 23 would give kk women and 12k12-k men, the number of committee selections is (2312)\binom{23}{12}. The answer is 081\boxed{081}. ~awang11's sol

Solution 2 (Bash)

We casework on the amount of men on the committee.

If there are no men in the committee, there are (121)\dbinom{12}{1} ways to pick the women on the committee, for a total of (110)(121)\dbinom{11}{0} \cdot \dbinom{12}{1}. Notice that (110)\dbinom{11}{0} is equal to (1111)\dbinom{11}{11}, so the case where no men are picked can be grouped with the case where all men are picked. When all men are picked, all women must also be picked, for a total of (1212)\dbinom{12}{12}. Therefore, these cases can be combined to

(110)((121)+(1212))\dbinom{11}{0} \cdot \left(\dbinom{12}{1} + \dbinom{12}{12}\right) Since (1212)=(120)\dbinom{12}{12} = \dbinom{12}{0}, and (120)+(121)=(131)\dbinom{12}{0} + \dbinom{12}{1} = \dbinom{13}{1}, we can further simplify this to

(110)(131)\dbinom{11}{0} \cdot \dbinom{13}{1} All other cases proceed similarly. For example, the case with one men or ten men is equal to (111)(132)\dbinom{11}{1} \cdot \dbinom{13}{2}. Now, if we factor out a 1313, then all cases except the first two have a factor of 121121, so we can factor this out too to make our computation slightly easier. The first two cases (with 1313 factored out) give 1+66=671+66=67, and the rest gives 121(10+75+270+504)=103,939121(10+75+270+504) = 103,939. Adding the 6767 gives 104,006104,006. Now, we can test for prime factors. We know there is a factor of 22, and the rest is 52,00352,003. We can also factor out a 77, for 7,4297,429, and the rest is 17192317 \cdot 19 \cdot 23. Adding up all the prime factors gives 2+7+13+17+19+23=0812+7+13+17+19+23 = \boxed{081}.

Video Solution:

https://youtu.be/MVxsY8DwHVk ~ avn

Solution 3 (Vandermonde's identity)

Applying [1] by setting m=12m=12, n=11n=11, and r=11r=11, we obtain (2311)    \binom{23}{11}\implies 081\boxed{081}. ~Lcz

Short Proof

Consider the following setup:

AIME diagram

The dots to the left represent the men, and the dots to the right represent the women. Now, suppose we put a mark on 1111 people (the *). Those to the left of the dashed line get to be "in" on the committee if they have a mark. Those on the right side of the dashed line are already on the committee, but if they're marked they get forcibly evicted from it. If there were xx people marked on the left, there ends up being 12(11x)=x+112-(11-x) = x+1 people not marked on the right. Circles represent those in the committee.

AIME diagram

We have our bijection, so the number of ways will be (2311)\binom{23}{11}.

~programjames1

Solution 4

Notice that the committee can consist of kk boys and k+1k+1 girls. Summing over all possible kk gives

k=011(11k)(12k+1)=(110)(121)+(111)(122)++(1111)(1212)\sum_{k=0}^{11}\binom{11}{k}\binom{12}{k+1}=\binom{11}{0}\binom{12}{1}+\binom{11}{1}\binom{12}{2}+\cdots + \binom{11}{11}\binom{12}{12} Using the identity (nk)=(nnk)\binom{n}{k}=\binom{n}{n-k}, and Pascal's Identity (nk)+(nk+1)=(n+1k+1)\binom{n}{k}+\binom{n}{k+1}=\binom{n+1}{k+1}, we get

k=011(11k)(12k+1)=(1212)+(121)((110)+(111))+\sum_{k=0}^{11}\binom{11}{k}\binom{12}{k+1}=\binom{12}{12}+\binom{12}{1}\left(\binom{11}{0}+\binom{11}{1}\right)+\cdots =(120)2+(121)2+(122)2+(123)2+(124)2+(125)2+(126)22=\binom{12}{0}^2+\binom{12}{1}^2+\binom{12}{2}^2+\binom{12}{3}^2+\binom{12}{4}^2+\binom{12}{5}^2+\frac{\binom{12}{6}^2}{2} =12k=012(12k)2=\frac{1}{2}\sum_{k=0}^{12}\binom{12}{k}^2 Using the identity k=0n(nk)2=(2nn)\sum_{k=0}^n\binom{n}{k}^2=\binom{2n}{n}, this simplifies to

12(2412)=242322212019181716151413212111098765432=2713171923\frac{1}{2}\cdot \binom{24}{12}=\frac{24\cdot 23\cdot 22\cdot 21\cdot 20\cdot 19\cdot 18\cdot 17\cdot 16\cdot 15\cdot 14\cdot 13}{2\cdot 12\cdot 11\cdot 10\cdot 9\cdot 8\cdot 7\cdot 6\cdot 5\cdot 4\cdot 3\cdot 2}=2\cdot 7\cdot 13\cdot 17\cdot 19\cdot 23 so the desired answer is 2+7+13+17+19+23=0812+7+13+17+19+23=\boxed{081} ~ktong

Solution 5 (Official MAA)

Select any 1111 club members. That group will have ii men and 11i11-i women, so the number of women in the club not selected in that group is 12(11i)=i+112 - (11-i) = i+1. Thus, if the committee includes the men who were selected and the women who were not selected, the committee would have the correct number of men and women. Conversely, for every committee that could be formed with ii men and i+1i+1 women, the men on this committee together with the women not on the committee comprise a subset of i+(12(i+1))=11i + (12 - (i+1)) = 11 club members. Thus

N=(2311)=23222120191817161514131110987654321=2319171372.N = \binom{23}{11}= \frac{23\cdot22\cdot21\cdot20\cdot19\cdot18\cdot17\cdot16\cdot15\cdot14\cdot13}{11\cdot10\cdot9\cdot8\cdot7\cdot6\cdot5\cdot4\cdot3\cdot2\cdot1}=23\cdot19\cdot17\cdot13\cdot7\cdot2. The requested sum is 23+19+17+13+7+2=08123+19+17+13+7+2=\boxed{081}.

Solution 6

Notice that if kk men are picked, then k+1k+1 women must be picked. Furthermore, kk can range from 00 to 1111. Then,

N=k=011(11k)(12k+1)=(110)(121)+(111)(122)++(1111)(1212)N=\sum_{k=0}^{11} \binom{11}{k}\binom{12}{k+1}=\binom{11}{0}\binom{12}{1}+\binom{11}{1}\binom{12}{2}+\dots+\binom{11}{11}\binom{12}{12} Since (nk)=(nnk)\binom{n}{k}=\binom{n}{n-k}, this equals

N=(110)(1211)+(111)(1210)++(1111)(120)N=\binom{11}{0}\binom{12}{11}+\binom{11}{1}\binom{12}{10}+\dots+\binom{11}{11}\binom{12}{0} According to Vandermonde's Identity,

N=(11+1211)=(2311)N=\binom{11+12}{11}=\binom{23}{11} N=23!11!12!=219395473112131719232103552711×283452711=2713171923081N=\frac{23!}{11!\cdot 12!}=\frac{2^{19}\cdot 3^9\cdot 5^4\cdot 7^3\cdot 11^2\cdot 13\cdot 17\cdot 19\cdot 23}{2^{10}\cdot 3^5\cdot 5^2\cdot 7\cdot 11\times 2^8\cdot 3^4\cdot 5^2\cdot 7\cdot 11}=2\cdot 7\cdot 13\cdot 17\cdot 19\cdot 23\rightarrow \boxed{081} ~sid2012

Solution 7 ( *Rigorous* Recursion)

Test the cases where there are 00 men 11 woman, 11 man 22 women, 22 men 33 women ... you will get the sequence 11, 33, 1010, 3535. Multiply all these numbers by 22 to get 22, 66, 2020, 7070, which is also (21)\binom{2}{1}, (42)\binom{4}{2}, (63)\binom{6}{3}, (84)\binom{8}{4}. Thus, continuing this pattern, the case with 1111 men and 1212 women should have (2412)2\frac{\binom{24}{12}}{2} ways to select the committee. -Kevin2010

Video Solution by OmegaLearn

https://youtu.be/pGkLAX381_s?t=684

~ pi_is_3.14

Video Solution

https://youtu.be/MVxsY8DwHVk

(Solves using both methods - Casework and Vandermonde's Identity)

Video Solution

https://www.youtube.com/watch?v=fxlQMiElGFk&list=PLLCzevlMcsWN9y8YI4KNPZlhdsjPTlRrb&index=6 ~ MathEx