HMMT 二月 2009 · GEN1 赛 · 第 9 题
HMMT February 2009 — GEN1 Round — Problem 9
题目详情
英文原题
- [ 6 ] How many functions f : { 1 , 2 , 3 , 4 , 5 } → { 1 , 2 , 3 , 4 , 5 } satisfy f ( f ( x )) = f ( x ) for all x ∈ { 1 , 2 , 3 , 4 , 5 } ?
解析
英文解析
- [ 6 ] How many functions f : { 1 , 2 , 3 , 4 , 5 } → { 1 , 2 , 3 , 4 , 5 } satisfy f ( f ( x )) = f ( x ) for all x ∈ { 1 , 2 , 3 , 4 , 5 } ?
Answer: 196
Solution: A fixed point of a function f is an element a such that f ( a ) = a . The condition is equivalentto the property that f maps every number to a fixed point. Counting by the number of fixed pointsof f , the total number of such functions is
( )
∑5
5 − k 5 0 4 1 3 25
k = 1 · (0 + 5 ) + 5 · (1 + 4 ) + 10 · (2 + 3 )
k =1 k = 1 + 25 + 10 · 17 = 196 .