Home > Just Math
Getting Maps In 2080 (Posted on 2007-08-17) |
|
Let S = {1; 2; 3; 4; 5; 6; 7}
Analytically determine the number of maps f from S to S such that
f2080(x) = x for every x belonging to S.
Note: The iteration is denoted by the superscript, such that
f1(x) = f(x) and fn(x) = f(fn-1(x))
for all n > 1.
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|