Difference between revisions of "2018 AIME II Problems/Problem 10"
(→Solution2) |
m (→Solution 2: ; fix typo) |
||
(41 intermediate revisions by 15 users not shown) | |||
Line 3: | Line 3: | ||
Find the number of functions <math>f(x)</math> from <math>\{1, 2, 3, 4, 5\}</math> to <math>\{1, 2, 3, 4, 5\}</math> that satisfy <math>f(f(x)) = f(f(f(x)))</math> for all <math>x</math> in <math>\{1, 2, 3, 4, 5\}</math>. | Find the number of functions <math>f(x)</math> from <math>\{1, 2, 3, 4, 5\}</math> to <math>\{1, 2, 3, 4, 5\}</math> that satisfy <math>f(f(x)) = f(f(f(x)))</math> for all <math>x</math> in <math>\{1, 2, 3, 4, 5\}</math>. | ||
− | ==Solution== | + | ==Solution 1== |
− | + | Just to visualize solution 1. If we list all possible <math>(x,f(x))</math>, from <math>{1,2,3,4,5}</math> to <math>{1,2,3,4,5}</math> in a specific order, we get <math>5 \cdot 5 = 25</math> different <math>(x,f(x))</math> 's. | |
+ | Namely: | ||
− | + | <cmath>(1,1) (1,2) (1,3) (1,4) (1,5)</cmath> | |
− | + | <cmath>(2,1) (2,2) (2,3) (2,4) (2,5)</cmath> | |
− | + | <cmath>(3,1) (3,2) (3,3) (3,4) (3,5)</cmath> | |
− | + | <cmath>(4,1) (4,2) (4,3) (4,4) (4,5)</cmath> | |
− | + | <cmath>(5,1) (5,2) (5,3) (5,4) (5,5)</cmath> | |
− | |||
− | |||
− | + | To list them in this specific order makes it a lot easier to solve this problem. We notice, In order to solve this problem at least one pair of <math>(x,x)</math> where <math>x\in{1,2,3,4,5}</math> must exist.In this case I rather "go backwards". First fixing <math>5</math> pairs <math>(x,x)</math>, (the diagonal of our table) and map them to the other fitting pairs <math>(x,f(x))</math>. You can do this in <math>\frac{5!}{5!} = 1</math> way. Then fixing <math>4</math> pairs <math>(x,x)</math> (The diagonal minus <math>1</math>) and map them to the other fitting pairs <math>(x,f(x))</math>. You can do this in | |
− | + | <math>4\cdot\frac{5!}{4!} = 20</math> ways. Then fixing <math>3</math> pairs <math>(x,x)</math> (The diagonal minus <math>2</math>) and map them to the other fitting pairs <math>(x,f(x))</math>. You can do this in <math>\tfrac{(5\cdot4\cdot3\cdot6\cdot3)}{3!2!} + \tfrac{(5\cdot4\cdot3\cdot6\cdot1)}{3!} = 150</math> ways. | |
− | + | Fixing <math>2</math> pairs <math>(x,x)</math> (the diagonal minus <math>3</math>) and map them to the other fitting pairs <math>(x,f(x))</math>. You can do this in <math>\frac{(5\cdot4\cdot6\cdot4\cdot2)}{2!3!} + \frac{(5\cdot4\cdot6\cdot4\cdot2)}{2!2!} + \frac{(5\cdot4\cdot6\cdot2\cdot1)}{2!2!} = 380</math> ways. | |
− | + | Lastly, fixing <math>1</math> pair <math>(x,x)</math> (the diagonal minus <math>4</math>) and map them to the other fitting pairs <math>(x,f(x))</math>. You can do this in <math>\tfrac{5!}{4!} + 4\cdot\tfrac{5!}{3!} + 5! = 205</math> ways. | |
− | |||
− | |||
− | + | So <math>1 + 20 + 150 + 380 + 205 = \framebox{756}</math> | |
− | |||
− | |||
− | |||
− | |||
− | + | ==Solution 2== | |
− | |||
− | + | We perform casework on the number of fixed points (the number of points where <math>f(x) = x</math>). To better visualize this, use the grid from Solution 1. | |
− | |||
− | + | '''Case 1:''' 5 fixed points | |
− | |||
− | + | :- Obviously, there must be <math>1</math> way to do so. | |
− | + | '''Case 2:''' 4 fixed points | |
− | <math>\textbf{Case 1:}</math> One "step" to "Good Points": Assume that <math>f(x)=x</math>, then we get <math>f(f(x))=f(f(f(x)))=f(x)</math>. | + | :- <math>\binom 54</math> ways to choose the <math>4</math> fixed points. For the sake of conversation, let them be <math>(1, 1), (2, 2), (3, 3), (4, 4)</math>. |
+ | :- The last point must be <math>(5, 1), (5, 2), (5, 3),</math> or <math>(5, 4)</math>. | ||
+ | :- There are <math>\binom 54 \cdot 4 = 20</math> solutions for this case. | ||
+ | |||
+ | '''Case 3:''' 3 fixed points | ||
+ | |||
+ | :- <math>\binom 53</math> ways to choose the <math>3</math> fixed points. For the sake of conversation, let them be <math>(1, 1), (2, 2), (3, 3)</math>. | ||
+ | :- '''Subcase 3.1:''' None of <math>4</math> or <math>5</math> map to each other | ||
+ | ::- The points must be <math>(4, 1), (4, 2), (4, 3)</math> and <math>(5, 1), (5, 2), (5, 3)</math>, giving <math>3 \cdot 3 = 9</math> solutions. | ||
+ | :- '''Subcase 3.2:''' <math>4</math> maps to <math>5</math> or <math>5</math> maps to <math>4</math> | ||
+ | ::- The points must be <math>(4, 5)</math> and <math>(5, 1), (5, 2), (5, 3)</math> or <math>(5, 4)</math> and <math>(4, 1), (4, 2), (4, 3)</math>, giving <math>3+3 = 6</math> solutions. | ||
+ | :- There are <math>\binom 53 \cdot (9+6) = 150</math> solutions for this case. | ||
+ | |||
+ | '''Case 4:''' 2 fixed points | ||
+ | |||
+ | :- <math>\binom 52</math> ways to choose the <math>2</math> fixed points. For the sake of conversation, let them be <math>(1, 1), (2, 2)</math>. | ||
+ | :- '''Subcase 4.1:''' None of <math>3</math>, <math>4</math>, or <math>5</math> map to each other | ||
+ | ::- There are <math>2 \cdot 2 \cdot 2 = 8</math> solutions for this case, by similar logic to '''Subcase 3.1'''. | ||
+ | :- '''Subcase 4.2:''' exactly one of <math>3, 4, 5</math> maps to another. | ||
+ | ::- Example: <math>(3, 4), (4, 1), (5, 2)</math> | ||
+ | ::- <math>\binom 32 \cdot 2! = 6</math> ways to choose the 2 which map to each other, and <math>2\cdot 2</math> ways to choose which ones of <math>1</math> and <math>2</math> they map to, giving <math>24</math> solutions for this case. | ||
+ | :- '''Subcase 4.3:''' two of <math>3, 4, 5</math> map to the third | ||
+ | ::- Example: <math>(3, 5), (4, 5), (5, 2)</math> | ||
+ | ::- <math>\binom 31</math> ways to choose which point is being mapped to, and <math>2</math> ways to choose which one of <math>1</math> and <math>2</math> it maps to, giving <math>6</math> solutions for this case. | ||
+ | :- There are <math>\binom 52 \cdot (8+24+6) = 380</math> solutions. | ||
+ | |||
+ | '''Case 5:''' 1 fixed point | ||
+ | :- <math>\binom 51</math> ways to choose the fixed point. For the sake of conversation, let it be <math>(1, 1)</math>. | ||
+ | :- '''Subcase 5.1:''' None of <math>2, 3, 4, 5</math> map to each other | ||
+ | ::- Obviously, there is <math>1^4 = 1</math> solution to this; all of them map to <math>1</math>. | ||
+ | :- '''Subcase 5.2:''' One maps to another, and the other two map to <math>1</math>. | ||
+ | ::- Example: <math>(2, 3), (3, 1), (4, 1), (5, 1)</math> | ||
+ | ::- There are <math>\binom 42 \cdot 2!</math> ways to choose which two map to each other, and since each must map to <math>1</math>, this gives <math>12</math>. | ||
+ | :- '''Subcase 5.3:''' One maps to another, and of the other two, one maps to the other as well. | ||
+ | ::- Example: <math>(2, 3), (3, 1), (5, 4), (4, 1)</math> | ||
+ | ::- There are <math>\binom 42 \cdot 2! \cdot 2! / 2!</math> ways to choose which ones map to another. This also gives <math>12</math>. | ||
+ | :- '''Subcase 5.4:''' 2 map to a third, and the fourth maps to <math>1</math>. | ||
+ | ::- Example: <math>(4, 2), (5, 2), (2, 1), (3, 1)</math> | ||
+ | ::- There are <math>\binom 42 \cdot \binom 21 = 12</math> ways again. | ||
+ | :- '''Subcase 5.5:''' 3 map to the fourth. | ||
+ | ::- Example: <math>(2, 4), (3, 4), (5, 4), (4, 1)</math> | ||
+ | ::- There are <math>\binom 41</math> ways to choose which one is being mapped to, giving <math>4</math> solutions. | ||
+ | :- There are <math>\binom 51 \cdot (1+12+12+12+4) = 205</math> solutions. | ||
+ | |||
+ | Therefore, the answer is <math>1+20+150+380+205 = \boxed{756}</math> | ||
+ | |||
+ | ~First | ||
+ | |||
+ | ==Solution 3== | ||
+ | |||
+ | We can do some caseworks about the special points of functions <math>f</math> for <math>x\in\{1,2,3,4,5\}</math>. Let <math>x</math>, <math>y</math> and <math>z</math> be three different elements in set <math>\{1,2,3,4,5\}</math>. There must be elements such like <math>k</math> in set <math>\{1,2,3,4,5\}</math> satisfies <math>f(k)=k</math>, and we call the points such like <math>(k,k)</math> on functions <math>f</math> are "Good Points" (Actually its academic name is "fixed-points"). The only thing we need to consider is the "steps" to get "Good Points". Notice that the "steps" must less than <math>3</math> because the highest iterations of function <math>f</math> is <math>3</math>. Now we can classify <math>3</math> cases of “Good points” of <math>f</math>. | ||
+ | |||
+ | <math>\textbf{Case 1:}</math> One "step" to "Good Points": Assume that <math>f(x)=x</math>, then we get <math>f(f(x))=f(x)=x</math>, and <math>f(f(f(x)))=f(f(x))=f(x)=x</math>, so <math>f(f(f(x)))=f(f(x))</math>. | ||
<math>\textbf{Case 2:}</math> Two "steps" to "Good Points": Assume that <math>f(x)=y</math> and <math>f(y)=y</math>, then we get <math>f(f(x))=f(y)=y</math>, and <math>f(f(f(x)))=f(f(y))=f(y)=y</math>, so <math>f(f(f(x)))=f(f(x))</math>. | <math>\textbf{Case 2:}</math> Two "steps" to "Good Points": Assume that <math>f(x)=y</math> and <math>f(y)=y</math>, then we get <math>f(f(x))=f(y)=y</math>, and <math>f(f(f(x)))=f(f(y))=f(y)=y</math>, so <math>f(f(f(x)))=f(f(x))</math>. | ||
Line 47: | Line 89: | ||
<math>\textbf{Case 3:}</math> Three "steps" to "Good Points": Assume that <math>f(x)=y</math>, <math>f(y)=z</math> and <math>f(z)=z</math>, then we get <math>f(f(x))=f(y)=z</math>, and <math>f(f(f(x)))=f(f(y))=f(z)=z</math>, so <math>f(f(f(x)))=f(f(x))</math>. | <math>\textbf{Case 3:}</math> Three "steps" to "Good Points": Assume that <math>f(x)=y</math>, <math>f(y)=z</math> and <math>f(z)=z</math>, then we get <math>f(f(x))=f(y)=z</math>, and <math>f(f(f(x)))=f(f(y))=f(z)=z</math>, so <math>f(f(f(x)))=f(f(x))</math>. | ||
− | + | Divide set <math>\{1,2,3,4,5\}</math> into three parts which satisfy these three cases, respectively. Let the first part has <math>a</math> elements, the second part has <math>b</math> elements and the third part has <math>c</math> elements, it is easy to see that <math>a+b+c=5</math>. First, there are <math>\binom{5}{a}</math> ways to select <math>x</math> for Case 1. Second, we have <math>\binom{5-a}{b}</math> ways to select <math>x</math> for Case 2. After that we map all elements that satisfy Case 2 to Case 1, and the total number of ways of this operation is <math>a^b</math>. Finally, we map all the elements that satisfy Case 3 to Case 2, and the total number of ways of this operation is <math>b^c</math>. As a result, the number of such functions <math>f</math> can be represented in an algebraic expression contains <math>a</math>, <math>b</math> and <math>c</math>: <math>\boxed{\binom{5}{a}\cdot \binom{5-a}{b}\cdot a^b\cdot b^c}</math> | |
− | Now it's time to | + | Now it's time to consider about the different values of <math>a</math>, <math>b</math> and <math>c</math> and the total number of functions <math>f</math> satisfy these values of <math>a</math>, <math>b</math> and <math>c</math>: |
− | For <math>a=5</math>, <math>b=0</math> and <math>c=0</math>, the number of <math>f</math> is <math>\binom{5}{5}=1</math> | + | For <math>a=5</math>, <math>b=0</math> and <math>c=0</math>, the number of <math>f</math>s is <math>\binom{5}{5}=1</math> |
− | For <math>a=4</math>, <math>b=1</math> and <math>c=0</math>, the number of <math>f</math> is <math>\binom{5}{4}\cdot \binom{1}{1}\cdot 4^1\cdot 1^0=20</math> | + | For <math>a=4</math>, <math>b=1</math> and <math>c=0</math>, the number of <math>f</math>s is <math>\binom{5}{4}\cdot \binom{1}{1}\cdot 4^1\cdot 1^0=20</math> |
− | For <math>a=3</math>, <math>b=1</math> and <math>c=1</math>, the number of <math>f</math> is <math>\binom{5}{3}\cdot \binom{2}{1}\cdot 3^1\cdot 1^1=60</math> | + | For <math>a=3</math>, <math>b=1</math> and <math>c=1</math>, the number of <math>f</math>s is <math>\binom{5}{3}\cdot \binom{2}{1}\cdot 3^1\cdot 1^1=60</math> |
− | For <math>a=3</math>, <math>b=2</math> and <math>c=0</math>, the number of <math>f</math> is <math>\binom{5}{3}\cdot \binom{2}{2}\cdot 3^2\cdot 2^0=90</math> | + | For <math>a=3</math>, <math>b=2</math> and <math>c=0</math>, the number of <math>f</math>s is <math>\binom{5}{3}\cdot \binom{2}{2}\cdot 3^2\cdot 2^0=90</math> |
− | For <math>a=2</math>, <math>b=1</math> and <math>c=2</math>, the number of <math>f</math> is <math>\binom{5}{2}\cdot \binom{3}{1}\cdot 2^1\cdot 1^2=60</math> | + | For <math>a=2</math>, <math>b=1</math> and <math>c=2</math>, the number of <math>f</math>s is <math>\binom{5}{2}\cdot \binom{3}{1}\cdot 2^1\cdot 1^2=60</math> |
− | For <math>a=2</math>, <math>b=2</math> and <math>c=1</math>, the number of <math>f</math> is <math>\binom{5}{2}\cdot \binom{3}{2}\cdot 2^2\cdot 2^1=240</math> | + | For <math>a=2</math>, <math>b=2</math> and <math>c=1</math>, the number of <math>f</math>s is <math>\binom{5}{2}\cdot \binom{3}{2}\cdot 2^2\cdot 2^1=240</math> |
− | For <math>a=2</math>, <math>b=3</math> and <math>c=0</math>, the number of <math>f</math> is <math>\binom{5}{2}\cdot \binom{3}{3}\cdot 2^3\cdot 3^0=80</math> | + | For <math>a=2</math>, <math>b=3</math> and <math>c=0</math>, the number of <math>f</math>s is <math>\binom{5}{2}\cdot \binom{3}{3}\cdot 2^3\cdot 3^0=80</math> |
− | For <math>a=1</math>, <math>b=1</math> and <math>c=3</math>, the number of <math>f</math> is <math>\binom{5}{1}\cdot \binom{4}{1}\cdot 1^1\cdot 1^3=20</math> | + | For <math>a=1</math>, <math>b=1</math> and <math>c=3</math>, the number of <math>f</math>s is <math>\binom{5}{1}\cdot \binom{4}{1}\cdot 1^1\cdot 1^3=20</math> |
− | For <math>a=1</math>, <math>b=2</math> and <math>c=2</math>, the number of <math>f</math> is <math>\binom{5}{1}\cdot \binom{4}{2}\cdot 1^2\cdot 2^2=120</math> | + | For <math>a=1</math>, <math>b=2</math> and <math>c=2</math>, the number of <math>f</math>s is <math>\binom{5}{1}\cdot \binom{4}{2}\cdot 1^2\cdot 2^2=120</math> |
− | For <math>a=1</math>, <math>b=3</math> and <math>c=1</math>, the number of <math>f</math> is <math>\binom{5}{1}\cdot \binom{4}{3}\cdot 1^3\cdot 3^1=60</math> | + | For <math>a=1</math>, <math>b=3</math> and <math>c=1</math>, the number of <math>f</math>s is <math>\binom{5}{1}\cdot \binom{4}{3}\cdot 1^3\cdot 3^1=60</math> |
− | For <math>a=1</math>, <math>b=4</math> and <math>c=0</math>, the number of <math>f</math> is <math>\binom{5}{1}\cdot \binom{4}{4}\cdot 1^4\cdot 4^0=5</math> | + | For <math>a=1</math>, <math>b=4</math> and <math>c=0</math>, the number of <math>f</math>s is <math>\binom{5}{1}\cdot \binom{4}{4}\cdot 1^4\cdot 4^0=5</math> |
Finally, we get the total number of function <math>f</math>, the number is <math>1+20+60+90+60+240+80+20+120+60+5=\boxed{756}</math> | Finally, we get the total number of function <math>f</math>, the number is <math>1+20+60+90+60+240+80+20+120+60+5=\boxed{756}</math> | ||
− | ~FYC | + | ~Solution by <math>BladeRunnerAUG</math> (Frank FYC) |
+ | ==Note (fun fact)== | ||
+ | This exact problem showed up earlier on the 2011 Stanford Math Tournament, Advanced Topics Test. | ||
+ | This problem also showed up on the 2010 Mock AIME 2 here: https://artofproblemsolving.com/wiki/index.php/Mock_AIME_2_2010_Problems | ||
+ | |||
+ | ==See Also== | ||
{{AIME box|year=2018|n=II|num-b=9|num-a=11}} | {{AIME box|year=2018|n=II|num-b=9|num-a=11}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
+ | |||
+ | [[Category: Intermediate Combinatorics Problems]] |
Latest revision as of 14:39, 5 November 2022
Problem
Find the number of functions from
to
that satisfy
for all
in
.
Solution 1
Just to visualize solution 1. If we list all possible , from
to
in a specific order, we get
different
's.
Namely:
To list them in this specific order makes it a lot easier to solve this problem. We notice, In order to solve this problem at least one pair of where
must exist.In this case I rather "go backwards". First fixing
pairs
, (the diagonal of our table) and map them to the other fitting pairs
. You can do this in
way. Then fixing
pairs
(The diagonal minus
) and map them to the other fitting pairs
. You can do this in
ways. Then fixing
pairs
(The diagonal minus
) and map them to the other fitting pairs
. You can do this in
ways.
Fixing
pairs
(the diagonal minus
) and map them to the other fitting pairs
. You can do this in
ways.
Lastly, fixing
pair
(the diagonal minus
) and map them to the other fitting pairs
. You can do this in
ways.
So
Solution 2
We perform casework on the number of fixed points (the number of points where ). To better visualize this, use the grid from Solution 1.
Case 1: 5 fixed points
- - Obviously, there must be
way to do so.
Case 2: 4 fixed points
- -
ways to choose the
fixed points. For the sake of conversation, let them be
.
- - The last point must be
or
.
- - There are
solutions for this case.
Case 3: 3 fixed points
- -
ways to choose the
fixed points. For the sake of conversation, let them be
.
- - Subcase 3.1: None of
or
map to each other
- - The points must be
and
, giving
solutions.
- - The points must be
- - Subcase 3.2:
maps to
or
maps to
- - The points must be
and
or
and
, giving
solutions.
- - The points must be
- - There are
solutions for this case.
Case 4: 2 fixed points
- -
ways to choose the
fixed points. For the sake of conversation, let them be
.
- - Subcase 4.1: None of
,
, or
map to each other
- - There are
solutions for this case, by similar logic to Subcase 3.1.
- - There are
- - Subcase 4.2: exactly one of
maps to another.
- - Example:
- -
ways to choose the 2 which map to each other, and
ways to choose which ones of
and
they map to, giving
solutions for this case.
- - Example:
- - Subcase 4.3: two of
map to the third
- - Example:
- -
ways to choose which point is being mapped to, and
ways to choose which one of
and
it maps to, giving
solutions for this case.
- - Example:
- - There are
solutions.
Case 5: 1 fixed point
- -
ways to choose the fixed point. For the sake of conversation, let it be
.
- - Subcase 5.1: None of
map to each other
- - Obviously, there is
solution to this; all of them map to
.
- - Obviously, there is
- - Subcase 5.2: One maps to another, and the other two map to
.
- - Example:
- - There are
ways to choose which two map to each other, and since each must map to
, this gives
.
- - Example:
- - Subcase 5.3: One maps to another, and of the other two, one maps to the other as well.
- - Example:
- - There are
ways to choose which ones map to another. This also gives
.
- - Example:
- - Subcase 5.4: 2 map to a third, and the fourth maps to
.
- - Example:
- - There are
ways again.
- - Example:
- - Subcase 5.5: 3 map to the fourth.
- - Example:
- - There are
ways to choose which one is being mapped to, giving
solutions.
- - Example:
- - There are
solutions.
Therefore, the answer is
~First
Solution 3
We can do some caseworks about the special points of functions for
. Let
,
and
be three different elements in set
. There must be elements such like
in set
satisfies
, and we call the points such like
on functions
are "Good Points" (Actually its academic name is "fixed-points"). The only thing we need to consider is the "steps" to get "Good Points". Notice that the "steps" must less than
because the highest iterations of function
is
. Now we can classify
cases of “Good points” of
.
One "step" to "Good Points": Assume that
, then we get
, and
, so
.
Two "steps" to "Good Points": Assume that
and
, then we get
, and
, so
.
Three "steps" to "Good Points": Assume that
,
and
, then we get
, and
, so
.
Divide set into three parts which satisfy these three cases, respectively. Let the first part has
elements, the second part has
elements and the third part has
elements, it is easy to see that
. First, there are
ways to select
for Case 1. Second, we have
ways to select
for Case 2. After that we map all elements that satisfy Case 2 to Case 1, and the total number of ways of this operation is
. Finally, we map all the elements that satisfy Case 3 to Case 2, and the total number of ways of this operation is
. As a result, the number of such functions
can be represented in an algebraic expression contains
,
and
:
Now it's time to consider about the different values of ,
and
and the total number of functions
satisfy these values of
,
and
:
For ,
and
, the number of
s is
For ,
and
, the number of
s is
For ,
and
, the number of
s is
For ,
and
, the number of
s is
For ,
and
, the number of
s is
For ,
and
, the number of
s is
For ,
and
, the number of
s is
For ,
and
, the number of
s is
For ,
and
, the number of
s is
For ,
and
, the number of
s is
For ,
and
, the number of
s is
Finally, we get the total number of function , the number is
~Solution by (Frank FYC)
Note (fun fact)
This exact problem showed up earlier on the 2011 Stanford Math Tournament, Advanced Topics Test. This problem also showed up on the 2010 Mock AIME 2 here: https://artofproblemsolving.com/wiki/index.php/Mock_AIME_2_2010_Problems
See Also
2018 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 9 |
Followed by Problem 11 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.