2013 AIME II 第 11 题

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

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

11.

设 A={1,2,3,4,5,6,7}A = \{1, 2, 3, 4, 5, 6, 7\},并设 NN 为从集合 AA 到集合 AA 的函数 ff 的个数,使得 f(f(x))f(f(x)) 是常值函数。求 NN 除以 10001000 的余数。

Let A={1,2,3,4,5,6,7},A = \{1, 2, 3, 4, 5, 6, 7\}, and let NN be the number of functions ff from set AA to set AA such that f(f(x))f(f(x)) is a constant function. Find the remainder when NN is divided by 1000.1000.

答案:399
知识点:函数组合分类讨论
难度评级:2890
小提示:

如果 f(f(x))=af(f(x)) = a 恒成立,令 SS 为被 ff 映到 aa 的元素集合。证明 f(a)=af(a) = a,且 SS 之外的每个元素都映入 S∖{a}S \setminus \{a\}。

If f(f(x))=af(f(x)) = a always, let SS be the set of elements that ff sends to a.a. Show f(a)=af(a) = a and every element outside SS maps into S∖{a}S \setminus \{a\}

大提示:

设 ∣S∣=k|S| = k:选择 aa,选择 SS 中其余元素,然后把外面的 7−k7 - k 个元素各自映到 S∖{a}S \setminus \{a\} 中的任意元素,并对 kk 求和。

With ∣S∣=k:|S| = k: choose a,a, choose the rest of S,S, then send each of the 7−k7 - k outside elements anywhere in S∖{a},S \setminus \{a\}, and sum over kk

解答:

设对所有 xx 都有 f(f(x))=af(f(x)) = a,并令 S={x:f(x)=a}S = \{x : f(x) = a\}。任取 t∈St \in S,得到 a=f(f(t))=f(a)a = f(f(t)) = f(a),所以 a∈Sa \in S。每个 xx 都满足 f(x)∈Sf(x) \in S(因为 f(f(x))=af(f(x)) = a),且若 x∉Sx \notin S,则 f(x)≠af(x) \ne a,所以 ff 把 SS 的补集映入 S∖{a}S \setminus \{a\}。反过来,按这种方式构造的任何 ff 都满足要求。

若 ∣S∣=k|S| = k,常值 aa 有 77 种选择,SS 中其余 k−1k - 1 个元素有 (6k−1)\binom{6}{k-1} 种选择,而其余 7−k7 - k 个元素各自在 S∖{a}S \setminus \{a\} 中选择像,共有 (k−1)7−k(k-1)^{7-k} 种。因此 N=7∑k=17(6k−1)(k−1)7−k=7(0+6+240+540+240+30+1)=7⋅1057=7399。 \begin{aligned} N &= \scriptsize 7\sum_{k=1}^{7} \binom{6}{k-1}(k-1)^{7-k} \\ &\scriptsize = 7\,(0 + 6 + 240 + 540 + 240 + 30 + 1) \\ &= 7 \cdot 1057 = 7399 \end{aligned}\text{。}

NN 除以 10001000 的余数是 399399。

Say f(f(x))=af(f(x)) = a for all x,x, and let S={x:f(x)=a}.S = \{x : f(x) = a\}. Picking any t∈S,t \in S, we get a=f(f(t))=f(a),a = f(f(t)) = f(a), so a∈S.a \in S. Every xx satisfies f(x)∈Sf(x) \in S (because f(f(x))=af(f(x)) = a), and if x∉Sx \notin S then f(x)≠a,f(x) \ne a, so ff maps the complement of SS into S∖{a}.S \setminus \{a\}. Conversely, any ff built this way works.

If ∣S∣=k,|S| = k, we choose the constant aa in 77 ways, the remaining k−1k - 1 elements of SS in (6k−1)\binom{6}{k-1} ways, and an image in S∖{a}S \setminus \{a\} for each of the 7−k7 - k other elements in (k−1)7−k(k-1)^{7-k} ways. Hence N=7∑k=17(6k−1)(k−1)7−k=7(0+6+240+540+240+30+1)=7⋅1057=7399. \begin{aligned} N &= \scriptsize 7\sum_{k=1}^{7} \binom{6}{k-1}(k-1)^{7-k} \\ &\scriptsize = 7\,(0 + 6 + 240 + 540 + 240 + 30 + 1) \\ &= 7 \cdot 1057 = 7399. \end{aligned}

The remainder when NN is divided by 10001000 is 399.399.

第 10 题#10
完整试卷

其他年份的第 11 题