2010 AIME I 第 7 题

先试着解答 2010 AIME I 第 7 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 2010 AIME I 解答,或核对答案

所有题目均经美国数学协会(MAA)官方合法授权使用。

7.

若集合的有序三元组 (A,B,C)(\mathcal{A}, \mathcal{B}, \mathcal{C}) 满足 AB=BC=CA=1|\mathcal{A} \cap \mathcal{B}| = |\mathcal{B} \cap \mathcal{C}| = |\mathcal{C} \cap \mathcal{A}| = 1,且 ABC=\mathcal{A} \cap \mathcal{B} \cap \mathcal{C} = \emptyset。则称它为极小相交的。例如,({1,2},{2,3},{1,3,4})(\{1, 2\}, \{2, 3\}, \{1, 3, 4\}) 是一个极小相交三元组。设 NN 为这样的极小相交有序集合三元组的个数,其中每个集合都是 {1,2,3,4,5,6,7}\{1, 2, 3, 4, 5, 6, 7\} 的子集。求 NN 除以 10001000 的余数。

注:S|\mathcal{S}| 表示集合 S\mathcal{S} 中元素的个数。

Define an ordered triple (A,B,C)(\mathcal{A}, \mathcal{B}, \mathcal{C}) of sets to be minimally intersecting if AB=BC=CA=1|\mathcal{A} \cap \mathcal{B}| = |\mathcal{B} \cap \mathcal{C}| = |\mathcal{C} \cap \mathcal{A}| = 1 and ABC=.\mathcal{A} \cap \mathcal{B} \cap \mathcal{C} = \emptyset. For example, ({1,2},{2,3},{1,3,4})(\{1, 2\}, \{2, 3\}, \{1, 3, 4\}) is a minimally intersecting triple. Let NN be the number of minimally intersecting ordered triples of sets for which each set is a subset of {1,2,3,4,5,6,7}.\{1, 2, 3, 4, 5, 6, 7\}. Find the remainder when NN is divided by 1000.1000.

Note: S|\mathcal{S}| represents the number of elements in the set S.\mathcal{S}.

答案:760
知识点:韦恩图乘法原理子集
难度评级:2510
解答:

AB={x}\mathcal{A} \cap \mathcal{B} = \{x\}BC={y}\mathcal{B} \cap \mathcal{C} = \{y\}CA={z}\mathcal{C} \cap \mathcal{A} = \{z\}。由于 ABC=\mathcal{A} \cap \mathcal{B} \cap \mathcal{C} = \emptyset,元素 xxyyzz 互不相同,并且可用 765=2107 \cdot 6 \cdot 5 = 210 种方式选出。

剩下 44 个元素都不能产生额外的两两交集,所以每个元素可以只属于 A\mathcal{A}B\mathcal{B}C\mathcal{C} 中的一个,或者都不属于:每个有 44 种选择,共 44=2564^4 = 256 种分配。

因此 N=210256=53760N = 210 \cdot 256 = 53760,除以 10001000 的余数为 760760

Write AB={x},\mathcal{A} \cap \mathcal{B} = \{x\}, BC={y},\mathcal{B} \cap \mathcal{C} = \{y\}, and CA={z}.\mathcal{C} \cap \mathcal{A} = \{z\}. Since ABC=,\mathcal{A} \cap \mathcal{B} \cap \mathcal{C} = \emptyset, the elements x,x, y,y, zz are distinct, and they can be chosen in 765=2107 \cdot 6 \cdot 5 = 210 ways.

Each of the remaining 44 elements must not create any further pairwise intersections, so it can belong to exactly one of A,\mathcal{A}, B,\mathcal{B}, C,\mathcal{C}, or to none of them: 44 choices each, for 44=2564^4 = 256 assignments.

Hence N=210256=53760,N = 210 \cdot 256 = 53760, and the remainder upon division by 10001000 is 760.760.

← 第 6 题#6
完整试卷

其他年份的第 7 题