Maths Olympiad Prep

Library / /159 of 397

Algebra Difficulty 5.6 AIME, harder Prove it Taiwan

S={1,2,,2012}S = \{1, 2, \dots, 2012\}。求滿足下列條件之函數 f:SSf : S \to S 的個數。

(1) ff 為一對一且映成函數。

(2) 對於所有數字 1a20121 \le a \le 2012,皆會有 f(a)+f1(a)=2013f(a) + f^{-1}(a) = 2013,其中 f1f^{-1}ff 的反函數。

Solution

Consider the following cases:

(1) If there exists aa such that f(a)=af(a) = a, then f(a)+f1(a)=2a2013f(a) + f^{-1}(a) = 2a \neq 2013. So this is impossible.

(2) If there exist aba \neq b such that f(a)=bf(a) = b and f(b)=af(b) = a, then f(a)+f1(a)=2b2013f(a) + f^{-1}(a) = 2b \neq 2013. So this is impossible.

(3) If there exist three distinct numbers a,b,ca, b, c such that f(a)=b,f(b)=cf(a) = b, f(b) = c and f(c)=af(c) = a, then f(a)+f1(a)=b+cf(a) + f^{-1}(a) = b + c and f(b)+f1(b)=c+af(b) + f^{-1}(b) = c + a. Since b+c=c+a=2013b + c = c + a = 2013, we get b=cb = c, which contradicts the assumption.

(4) If there exist kk (with k5k \ge 5) distinct numbers a1,a2,,aka_1, a_2, \dots, a_k such that f(a1)=a2,f(a2)=a3,,f(ak1)=akf(a_1) = a_2, f(a_2) = a_3, \dots, f(a_{k-1}) = a_k and f(ak)=a1f(a_k) = a_1, then f(a2)+f1(a2)=a3+a1=2013=f(a4)+f1(a4)=a5+a3f(a_2) + f^{-1}(a_2) = a_3 + a_1 = 2013 = f(a_4) + f^{-1}(a_4) = a_5 + a_3, which gives a1=a5a_1 = a_5, contradicting the assumption.

(5) If there exist 4 distinct numbers a,b,c,da, b, c, d such that f(a)=b,f(b)=c,f(c)=df(a) = b, f(b) = c, f(c) = d and f(d)=af(d) = a, then f(b)+f1(b)=a+c=2013=f(d)+f1(d)f(b) + f^{-1}(b) = a + c = 2013 = f(d) + f^{-1}(d), i.e., c=2013ac = 2013 - a; also f(a)+f1(a)=b+d=2013=f(c)+f1(c)f(a) + f^{-1}(a) = b + d = 2013 = f(c) + f^{-1}(c), i.e., d=2013bd = 2013 - b. Therefore (a,b,c,d)=(a,b,2013a,2013b)(a, b, c, d) = (a, b, 2013 - a, 2013 - b) forms a cyclic group.

Since only (5) can hold, it suffices to determine 503 cyclic groups (ai,bi,2013ai,2013bi)(a_i, b_i, 2013-a_i, 2013-b_i) to determine such a function ff. Since aia_i and 2013ai2013-a_i respectively have one less than 1007 and one greater than 1007; the same holds for bib_i and 2013bi2013-b_i; so we may assume 1ai,bi10061 \le a_i, b_i \le 1006 in order to determine (ai,bi,2013ai,2013bi)(a_i, b_i, 2013-a_i, 2013-b_i) (at this point it is no longer a cyclic group, but an ordered group). Choosing a1,b1,a2,b2,,a503,b503a_1,b_1,a_2,b_2,\cdots,a_{503},b_{503} in order from {1,2,,1006}\{1,2,\cdots,1006\}, there are 1006!1006! possibilities; however, these 503 groups have no order among themselves, so the number of ff is:
1006!503! \frac{1006!}{503!}

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from zh; metadata (topic, difficulty) added by this project.