返回题库

AIME 2009 II · 第 6 题

AIME 2009 II — Problem 6

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Let mm be the number of five-element subsets that can be chosen from the set of the first 1414 natural numbers so that at least two of the five numbers are consecutive. Find the remainder when mm is divided by 10001000.

解析

Solution

We can use complementary counting. We can choose a five-element subset in (145){14\choose 5} ways. We will now count those where no two numbers are consecutive. We will show a bijection between this set, and the set of 10-element strings that contain 5 AAs and 5 BBs, thereby showing that there are (105){10\choose 5} such sets.

Given a five-element subset SS of {1,2,,14}\{1,2,\dots,14\} in which no two numbers are consecutive, we can start by writing down a string of length 14, in which the ii-th character is AA if iSi\in S and BB otherwise. Now we got a string with 5 AAs and 9 BBs. As no two numbers were consecutive, we know that in our string no two AAs are consecutive. We can now remove exactly one BB from between each pair of AAs to get a string with 5 AAs and 5 BBs. And clearly this is a bijection, as from each string with 5 AAs and 5 BBs we can reconstruct one original set by reversing the construction.

Hence we have m=(145)(105)=2002252=1750m = {14\choose 5} - {10\choose 5} = 2002 - 252 = 1750, and the answer is 1750mod1000=7501750 \bmod 1000 = \boxed{750}.

Solution 2

Let AA be the number of ways in which 55 distinct numbers can be selected from the set of the first 1414 natural numbers, and let BB be the number of ways in which 55 distinct numbers, no two of which are consecutive, can be selected from the same set. Then m=ABm = A -B. Because A=(145)A = \dbinom{14}{5}, the problem is reduced to finding BB. Consider the natural numbers 1a1<a2<a3<a4<a5141 \leq a_1 < a_2 < a_3 < a_4 < a_5 \leq 14. If no two of them are consecutive, the numbers b1=a1,b2=a21b_1 = a_1, b_2 = a_2 - 1, b3=a32b_3 = a_3 - 2, b4=a43b_4 = a_4 - 3, and b5=a54b_5 = a_5 - 4 are distinct numbers from the interval [1,10][1, 10]. Conversely, if b1<b2<b3<b4<b5b_1 < b_2 < b_3 < b_4 < b_5 are distinct natural numbers from the interval [1,10][1, 10], then a1=b1a_1 = b_1, a2=b2+1a_2 = b_2 + 1, a3=b3+2a_3 = b_3 + 2, a4=b4+3a_4 = b_4 + 3, and a5=b5+4a_5 = b_5 + 4 are from the interval [1,14][1, 14], and no two of them are consecutive. Therefore counting BB is the same as counting the number of ways of choosing 55 distinct numbers from the set of the first 1010 natural numbers. Thus B=(105)B = \dbinom{10}{5}. Hence m=AB=(145)(105)=2002252=1750m = A - B = \dbinom{14}{5} - \dbinom{10}{5} = 2002 - 252 = 1750 and the answer is 750750.

Solution 3

We will approach this problem using complementary counting. First it is obvious, there are (145)\binom{14}{5} total sets. To find the number of sets with NO consecutive elements, we do a little experimentation. Consider the following:

Start of with any of the 1414 numbers, say WLOG, 11. Then we cannot have 22. So again WLOG, we may pick 33. Then we cannot have 44, so again WLOG, we may pick 55. Then not 66, but 77, then not 88, but 99. Now we have the set 1,3,5,7,9{1,3,5,7,9}, and we had to remove 44 digits from the 1414 total amount, so there wasn't any consecutive numbers. So we have that the number of non-consecutive cardinality 55 sets, is (1445)=(105)\binom{14-4}{5}=\binom{10}{5}. Now you already read the solutions above, and if you are here, you are either confused, or looking for more. So now the answer is simply 17501750, which is 750\boxed{750} (mod 10001000).

~th1nq3r

(To get a feel for my solution, draw the set {_, _, _, _, _}, list all the 1414 numbers on the side, and fill up the set starting with 11 and doing the steps I used for my solution).

Solution 4 (Stars and Bars)

We will proceed by complementary counting. We can easily see that there are (145)\binom{14}{5} ways to select 55 element subsets from the original set. Now, we must find the number of subsets part of that group that do NOT have any consecutive integers.

We can think of this situation as stars and bars. We have 99 stars and 55 bars, where the stars represent the integers NOT in the subset while the bars ARE the integers in the chosen subset. We want the amount of combinations where there is at least one star between each bar (meaning that none of the integers in the subset are consecutive). To do this, we remove 44 stars from the total 99 stars (44 because that is the amount that is between each bar). Now, we have 55 stars and 55 bars with no restrictions, so we calculate this as (105)\binom{10}{5}, which is 252252. Hence, (145)(105)=2002252=1750\binom{14}{5} - \binom{10}{5} = 2002 - 252 = 1750, which becomes 750\boxed{750}.