- 鐵幣
- 1885 元
- 文章
- 1396 篇
- 聲望
- 1332 枚
- 上次登入
- 15-11-14
- 精華
- 3
- 註冊時間
- 06-7-21
- UID
- 284795
|
原文由M.N.M. 於 07-6-30 09:13 PM 發表
2. How many nonempty subsets of {1,2,3...,12} have the property that the sum of the largest element and the smallest element is 13 ?
Sol)
We consider that the partitions of 13 are (1,12),(2,11),...,(6,7).
Then use each of them to make a subset of {1,2,...,12}.
First,the subsets containing 1 and 12 may contain elements 11,10,...,and 2.
Therefore,the number of the these is C(10,10)+C(10,9)+...+C(10,0)=2^10.
Second,consider the pair (2,11).
Since they play the roles of the largest one and the smallest one,subsets of (2,11) have at most 10 elements.
Thus,the pair has C(8,8)+C(8,7)+...+C(8,0)=2^8 subsets.
Continue in this way.There are 2^0+2^2+...+2^10=((2^2)^6-1)/(2^2-1) subsets...#
(譯)
我們考慮對13的分割有(1,12),(2,11),...,(6,7).
然後用每一個去作一個{1,2,...,12}的子集.
首先,包含1跟12的子集可能包含11,10,...,2這些元素.
因此,這些子集的個數有C(10,10)+C(10,9)+...+C(10,0)=2^10個.
其次,考慮(2,11)這個配對.
因為他們各扮演最大跟最小的數字,所以(2,11)的子集至多有10個元素.
因此,這個配對有C(8,8)+C(8,7)+...+C(8,0)=2^8個子集.
這樣持續下去,總共有2^0+2^2+...+2^10=((2^2)^6-1)/(2^2-1)個子集...#
[ 本文最後由 傲月光希 於 07-6-30 10:52 PM 編輯 ] |
|