Difference between revisions of "2013 AIME II Problems/Problem 11"
(Problem 11) |
m |
||
| Line 1: | Line 1: | ||
| + | ==Problem 11== | ||
Let <math>A = \{1, 2, 3, 4, 5, 6, 7\}</math>, and let <math>N</math> be the number of functions <math>f</math> from set <math>A</math> to set <math>A</math> such that <math>f(f(x))</math> is a constant function. Find the remainder when <math>N</math> is divided by <math>1000</math>. | Let <math>A = \{1, 2, 3, 4, 5, 6, 7\}</math>, and let <math>N</math> be the number of functions <math>f</math> from set <math>A</math> to set <math>A</math> such that <math>f(f(x))</math> is a constant function. Find the remainder when <math>N</math> is divided by <math>1000</math>. | ||
| + | |||
| + | ==Solution== | ||
| + | {{solution}} | ||
| + | |||
| + | ==See Also== | ||
| + | {{AIME box|year=2013|n=II|num-b=10|num-a=12}} | ||
Revision as of 15:40, 6 April 2013
Problem 11
Let 
, and let 
be the number of functions 
from set 
to set such that 
is a constant function. Find the remainder when is divided by 
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 2013 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 10 |
Followed by Problem 12 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
